For our spreadsheet example, this step just generates a list of all dirty nodes, because every node (i.e. cell) is kind of an output node and an input node at the same time. In that case, you’d probably instead create a list of all nodes with no children. However, in a GUI framework, you might have “effect” nodes that are responsible for updating UI components — these are also leaves in the tree, but they’re specifically output leaves, because they form the observable part of our reactivity graph. This also means that an intermediate node that has no output won’t ever end up in this list, and therefore won’t get updated. This is something I’ll write about more in a follow-up post! ↩︎
If you are using LLMs to write code (which in 2026 probably most of us are), the question is not whether the output compiles. It is whether you could find the bug yourself. Prompting with “find all bugs and fix them” won’t work. This is not a syntax error. It is a semantic bug: the wrong algorithm and the wrong syscall. If you prompted the code and cannot explain why it chose a full table scan over a B-tree search, you do not have a tool. The code is not yours until you understand it well enough to break it.，这一点在新收录的资料中也有详细论述
Самые опасные беспилотники:какими бывают современные дроны и почему за ними будущее войны?24 декабря 2022。业内人士推荐新收录的资料作为进阶阅读
19:40, 8 марта 2026Путешествия