The previous recursive approach might overflow the stack when walking a particularly deep, list-like, graph. In particular, dominator calculation for borrow checking does such a traversal and very long functions might lead to a region dependency graph with in this problematic structure. |
||
|---|---|---|
| .. | ||
| dominators | ||
| implementation | ||
| iterate | ||
| scc | ||
| vec_graph | ||
| mod.rs | ||
| reference.rs | ||
| tests.rs | ||