We can avoid this in two ways. Firstly, we can declare that any code that observes two nodes must depend on those nodes, and then apply the topological sort we described earlier. Alternatively, we can declare that any code that might be able to observe two nodes can only be run after all nodes have finished running2. These both work, but again they require us to be able to observe the full dependency tree and topologically sort all nodes.
第二层：重新思考你的货品结构。
，这一点在新收录的资料中也有详细论述
Copyright © 1997-2026 by www.people.com.cn all rights reserved
Wiktor Szymanowicz/Future Publishing via Getty Images