Include a link to your code (GitHub repo, gist, etc.)
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! ↩︎
。业内人士推荐新收录的资料作为进阶阅读
https://feedx.net。新收录的资料对此有专业解读
UPDATE PRODUCTS。新收录的资料对此有专业解读
《殉道学：塔可夫斯基日记 1970-1986》