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! ↩︎
99 百分位：2.309 毫秒，99.9 百分位：131.528 毫秒
，更多细节参见搜狗输入法
（应受访者要求，程啸、赵然、苏西为化名）
European Commission