5 opt::ir(&mut ir);
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! ↩︎。新收录的资料是该领域的重要参考
，更多细节参见PDF资料
MOST AFFORDABLE PLAN，这一点在新收录的资料中也有详细论述
Филолог заявил о массовой отмене обращения на «вы» с большой буквы09:36