File tree Expand file tree Collapse file tree 1 file changed +5
-5
lines changed
src/librustc_data_structures/obligation_forest Expand file tree Collapse file tree 1 file changed +5
-5
lines changed Original file line number Diff line number Diff line change 66
66
//! For the most part, comments specific to the implementation are in the
67
67
//! code. This file only contains a very high-level overview. Basically,
68
68
//! the forest is stored in a vector. Each element of the vector is a node
69
- //! in some tree. Each node in the vector has the index of an (optional)
70
- //! parent and (for convenience) its root (which may be itself) . It also
71
- //! has a current state, described by `NodeState`. After each
72
- //! processing step, we compress the vector to remove completed and error
73
- //! nodes, which aren't needed anymore.
69
+ //! in some tree. Each node in the vector has the index of its dependents,
70
+ //! including the first dependent which is known as the parent . It also
71
+ //! has a current state, described by `NodeState`. After each processing
72
+ //! step, we compress the vector to remove completed and error nodes, which
73
+ //! aren't needed anymore.
74
74
75
75
use crate :: fx:: { FxHashMap , FxHashSet } ;
76
76
use crate :: indexed_vec:: Idx ;
You can’t perform that action at this time.
0 commit comments