Searched refs:BeingVisited (Results 1 – 6 of 6) sorted by relevance
| /dports/devel/racer/racer-2.1.48/cargo-crates/rustc-ap-rustc_data_structures-718.0.0/src/graph/scc/ |
| H A D | mod.rs | 184 BeingVisited { depth: usize }, enumerator
270 NodeState::BeingVisited { depth: min_depth } => WalkReturn::Cycle { min_depth }, in inspect_node()
308 NodeState::BeingVisited { depth } => break NodeState::BeingVisited { depth }, in find_state()
388 NodeState::BeingVisited { depth } => { in find_state()
459 self.node_states[node] = NodeState::BeingVisited { depth }; in walk_unvisited_node()
|
| /dports/devel/racer/racer-2.1.48/cargo-crates/rustc-ap-rustc_data_structures-722.0.0/src/graph/scc/ |
| H A D | mod.rs | 184 BeingVisited { depth: usize }, enumerator
270 NodeState::BeingVisited { depth: min_depth } => WalkReturn::Cycle { min_depth }, in inspect_node()
308 NodeState::BeingVisited { depth } => break NodeState::BeingVisited { depth }, in find_state()
388 NodeState::BeingVisited { depth } => { in find_state()
459 self.node_states[node] = NodeState::BeingVisited { depth }; in walk_unvisited_node()
|
| /dports/lang/rust/rustc-1.58.1-src/compiler/rustc_data_structures/src/graph/scc/ |
| H A D | mod.rs | 184 BeingVisited { depth: usize }, enumerator
270 NodeState::BeingVisited { depth: min_depth } => WalkReturn::Cycle { min_depth }, in inspect_node()
308 NodeState::BeingVisited { depth } => break NodeState::BeingVisited { depth }, in find_state()
388 NodeState::BeingVisited { depth } => { in find_state()
460 self.node_states[node] = NodeState::BeingVisited { depth }; in walk_unvisited_node()
|
| /dports/lang/rust/rustc-1.58.1-src/vendor/rustc-ap-rustc_data_structures/src/graph/scc/ |
| H A D | mod.rs | 184 BeingVisited { depth: usize }, enumerator
270 NodeState::BeingVisited { depth: min_depth } => WalkReturn::Cycle { min_depth }, in inspect_node()
308 NodeState::BeingVisited { depth } => break NodeState::BeingVisited { depth }, in find_state()
388 NodeState::BeingVisited { depth } => { in find_state()
459 self.node_states[node] = NodeState::BeingVisited { depth }; in walk_unvisited_node()
|
| /dports/polish/kadu/kadu-4.3/kadu-core/misc/graph/ |
| H A D | graph-algorithm.h | 153 BeingVisited, enumerator
162 m_visitStates.insert({node, VisitState::BeingVisited}); in visitNode()
176 else if ((*visitState).second == VisitState::BeingVisited) in sortSuccessors()
|
| /dports/www/geneweb/geneweb-13c850a0cc3973daf7ae3e0772a1621f84052041/src/ |
| H A D | consang.ml | 46 type visit = [ NotVisited | BeingVisited | Visited ]; Constructor
58 tab.(i) := BeingVisited;
65 | BeingVisited -> error (OwnAncestor (poi base (Adef.iper_of_int i)))
71 | BeingVisited -> failwith "check_noloop algorithm error"
163 tab.(i) := BeingVisited;
169 | BeingVisited -> error (OwnAncestor (poi base ip))
|