2024-05-25 UTC
# 
[qubyte] Nope, I totally winged it. The basic idea is that each node declares its dependencies, and you register all the nodes at the same time. As the inputs of a node become available, it gets computed. Should a node be invalidated (for example, a file changes), it’s subtree of dependants becomes invalid and computation starts again at the invalidated node. There are caveats though. For example, nodes can declare teardown (for example, clean up o