Eventually, we’ll have a tree with mixed dirty and clean nodes, where only the dirty nodes need updating. Importantly, unlike the original push-based reactivity, the order that we visit the nodes isn’t important5. This means we don’t need to figure out the optimal path through the entire tree, and can use a simpler recursive algorithm, as long as we make sure to skip any nodes that were already marked as dirty.
Антон Похиляк (редактор отдела оперативной информации)
，推荐阅读新收录的资料获取更多信息
喊了一整年“电动化卷完了，智能化下半场开始了”的车厂，又卷回了电动化。只不过这一次，战场从单一的技术路线，变成了补能体系的正面碰撞。
skip acceleration