| /aosp_15_r20/external/rust/android-crates-io/crates/petgraph/src/ |
| D | data.rs | 47 fn add_node(&mut self, weight: Self::NodeWeight) -> Self::NodeId; in add_node()
52 a: Self::NodeId, in add_edge()
53 b: Self::NodeId, in add_edge()
62 a: Self::NodeId, in update_edge()
63 b: Self::NodeId, in update_edge()
140 fn add_node(&mut self, weight: Self::NodeWeight) -> Self::NodeId { in add_node()
145 a: Self::NodeId, in add_edge()
146 b: Self::NodeId, in add_edge()
153 a: Self::NodeId, in update_edge()
154 b: Self::NodeId, in update_edge()
[all …]
|
| D | lib.rs | 236 type NodeId; typedef
237 fn into_weighted_edge(self) -> (Self::NodeId, Self::NodeId, E); in into_weighted_edge()
244 type NodeId = Ix; typedef
253 type NodeId = Ix; typedef
263 type NodeId = Ix; typedef
275 type NodeId = Ix; typedef
287 type NodeId = Ix; typedef
|
| D | adj.rs | 79 type NodeId = NodeIndex<Ix>; typedef
82 fn source(&self) -> Self::NodeId { in source()
85 fn target(&self) -> Self::NodeId { in target()
416 type NodeId = NodeIndex<Ix>; typedef
442 type NodeId = NodeIndex<Ix>; typedef
444 fn id(&self) -> Self::NodeId { in id()
587 fn from_index(&self, i: usize) -> Self::NodeId { in from_index()
|
| /aosp_15_r20/external/rust/android-crates-io/crates/petgraph/src/algo/ |
| D | isomorphism.rs | 69 pub fn push_mapping(&mut self, from: G::NodeId, to: usize) { in push_mapping()
92 pub fn pop_mapping(&mut self, from: G::NodeId) { in pop_mapping()
158 fn eq(&mut self, _g0: &G0, _g1: &G1, _n0: G0::NodeId, _n1: G1::NodeId) -> bool; in eq()
167 fn eq(&mut self, _g0: &G0, _g1: &G1, _n0: G0::NodeId, _n1: G1::NodeId) -> bool { in eq()
183 fn eq(&mut self, g0: &G0, g1: &G1, n0: G0::NodeId, n1: G1::NodeId) -> bool { in eq()
198 e0: (G0::NodeId, G0::NodeId), in eq()
199 e1: (G1::NodeId, G1::NodeId), in eq()
213 _e0: (G0::NodeId, G0::NodeId), in eq()
214 _e1: (G1::NodeId, G1::NodeId), in eq()
235 e0: (G0::NodeId, G0::NodeId), in eq()
[all …]
|
| D | matching.rs | 22 fn new(graph: G, mate: Vec<Option<G::NodeId>>, n_edges: usize) -> Self { in new()
38 pub fn mate(&self, node: G::NodeId) -> Option<G::NodeId> { in mate()
66 pub fn contains_edge(&self, a: G::NodeId, b: G::NodeId) -> bool { in contains_edge()
110 fn try_from_index(&self, i: usize) -> Option<Self::NodeId>; in try_from_index()
125 fn try_from_index(&self, i: usize) -> Option<Self::NodeId> { in try_from_index()
216 fn greedy_matching_inner<G>(graph: &G) -> (Vec<Option<G::NodeId>>, usize) in greedy_matching_inner()
244 fn non_backtracking_dfs<G, F>(graph: &G, source: G::NodeId, visited: &mut G::Map, mut visitor: F) in non_backtracking_dfs()
247 F: FnMut(G::NodeId), in non_backtracking_dfs()
291 fn to_vertex(&self) -> Option<G::NodeId> { in to_vertex()
496 mate: &[Option<G::NodeId>], in find_join()
[all …]
|
| D | mod.rs | 139 space: Option<&mut DfsSpace<G::NodeId, G::Map>>, in toposort()
140 ) -> Result<Vec<G::NodeId>, Cycle<G::NodeId>> in toposort()
226 G: GraphRef + Visitable<NodeId = N, Map = VM>, in new()
250 F: FnOnce(&mut Dfs<G::NodeId, G::Map>) -> R, in with_dfs()
270 from: G::NodeId, in has_path_connecting()
271 to: G::NodeId, in has_path_connecting()
272 space: Option<&mut DfsSpace<G::NodeId, G::Map>>, in has_path_connecting()
395 G: IntoNodeIdentifiers<NodeId = N> + IntoNeighbors<NodeId = N> + NodeIndexable<NodeId = N>, in run()
413 fn visit<G, F>(&mut self, v: G::NodeId, g: G, f: &mut F) in visit()
415 G: IntoNeighbors<NodeId = N> + NodeIndexable<NodeId = N>, in visit()
[all …]
|
| D | ford_fulkerson.rs | 17 vertex: N::NodeId, in residual_capacity()
54 source: N::NodeId, in has_augmented_path()
55 destination: N::NodeId, in has_augmented_path()
91 vertex: N::NodeId, in adjust_residual_flow()
148 source: N::NodeId, in ford_fulkerson()
149 destination: N::NodeId, in ford_fulkerson()
|
| D | astar.rs | 68 start: G::NodeId, in astar()
161 fn set_predecessor(&mut self, node: G::NodeId, previous: G::NodeId) { in set_predecessor()
165 fn reconstruct_path_to(&self, last: G::NodeId) -> Vec<G::NodeId> { in reconstruct_path_to()
|
| D | dijkstra.rs | 74 start: G::NodeId, in dijkstra()
75 goal: Option<G::NodeId>, in dijkstra()
77 ) -> HashMap<G::NodeId, K> in dijkstra()
|
| D | k_shortest_path.rs | 75 start: G::NodeId, in k_shortest_path()
76 goal: Option<G::NodeId>, in k_shortest_path()
79 ) -> HashMap<G::NodeId, K> in k_shortest_path()
|
| D | simple_paths.rs | 38 from: G::NodeId, in all_simple_paths()
39 to: G::NodeId, in all_simple_paths()
47 TargetColl: FromIterator<G::NodeId>, in all_simple_paths()
|
| D | bellman_ford.rs | 83 source: G::NodeId, in bellman_ford()
84 ) -> Result<Paths<G::NodeId, G::EdgeWeight>, NegativeCycle> in bellman_ford()
213 source: G::NodeId, in bellman_ford_initialize_relax()
|
| /aosp_15_r20/external/rust/android-crates-io/crates/petgraph/src/visit/ |
| D | traversal.rs | 65 G: GraphRef + Visitable<NodeId = N, Map = VM>, in new()
80 G: GraphRef + Visitable<NodeId = N, Map = VM>, in reset()
89 G: GraphRef + Visitable<NodeId = N, Map = VM>, in empty()
107 G: IntoNeighbors<NodeId = N>, in next()
162 G: GraphRef + Visitable<NodeId = N, Map = VM>, in new()
172 G: GraphRef + Visitable<NodeId = N, Map = VM>, in empty()
184 G: GraphRef + Visitable<NodeId = N, Map = VM>, in reset()
201 G: IntoNeighbors<NodeId = N>, in next()
281 G: GraphRef + Visitable<NodeId = N, Map = VM>, in new()
293 G: IntoNeighbors<NodeId = N>, in next()
[all …]
|
| D | mod.rs | 222 type NodeId; typedef
226 fn source(&self) -> Self::NodeId; in source()
228 fn target(&self) -> Self::NodeId; in target()
239 type NodeId = N; typedef
259 type NodeId; typedef
261 fn id(&self) -> Self::NodeId; in id()
282 type NodeId = Id; typedef
284 fn id(&self) -> Self::NodeId { in id()
297 type NodeId = Id; typedef
299 fn id(&self) -> Self::NodeId { in id()
|
| D | reversed.rs | 17 type NodeId = G::NodeId; typedef
40 fn neighbors_directed(self, n: G::NodeId, d: Direction) -> G::NeighborsDirected { in neighbors_directed()
62 fn edges_directed(self, a: Self::NodeId, dir: Direction) -> Self::Edges { in edges_directed()
120 type NodeId = R::NodeId; typedef
123 fn source(&self) -> Self::NodeId { in source()
126 fn target(&self) -> Self::NodeId { in target()
|
| D | filter.rs | 89 type NodeId = G::NodeId; typedef
143 fn neighbors_directed(self, n: G::NodeId, dir: Direction) -> Self::NeighborsDirected { in neighbors_directed()
277 fn edges_directed(self, a: G::NodeId, dir: Direction) -> Self::EdgesDirected { in edges_directed()
396 type NodeId = G::NodeId; typedef
420 fn neighbors_directed(self, n: G::NodeId, dir: Direction) -> Self::NeighborsDirected { in neighbors_directed()
501 fn edges_directed(self, n: G::NodeId, dir: Direction) -> Self::EdgesDirected { in edges_directed()
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r536225/include/clang/Tooling/ASTDiff/ |
| D | ASTDiffInternal.h | 21 struct NodeId { struct
28 NodeId() : Id(InvalidNodeId) {} in NodeId() argument
29 NodeId(int Id) : Id(Id) {} in NodeId() argument
37 bool isValid() const { return Id != InvalidNodeId; } in isValid() argument
38 bool isInvalid() const { return Id == InvalidNodeId; } in isInvalid() argument
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r522817/include/clang/Tooling/ASTDiff/ |
| D | ASTDiffInternal.h | 21 struct NodeId { struct
28 NodeId() : Id(InvalidNodeId) {} in NodeId() function
29 NodeId(int Id) : Id(Id) {} in NodeId() argument
37 bool isValid() const { return Id != InvalidNodeId; } in isValid() argument
38 bool isInvalid() const { return Id == InvalidNodeId; } in isInvalid() argument
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567/include/clang/Tooling/ASTDiff/ |
| D | ASTDiffInternal.h | 21 struct NodeId { struct
28 NodeId() : Id(InvalidNodeId) {} in NodeId() function
29 NodeId(int Id) : Id(Id) {} in NodeId() function
37 bool isValid() const { return Id != InvalidNodeId; } in isValid() argument
38 bool isInvalid() const { return Id == InvalidNodeId; } in isInvalid() argument
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567b/include/clang/Tooling/ASTDiff/ |
| D | ASTDiffInternal.h | 21 struct NodeId { struct
28 NodeId() : Id(InvalidNodeId) {} in NodeId() function
29 NodeId(int Id) : Id(Id) {} in NodeId() function
37 bool isValid() const { return Id != InvalidNodeId; } in isValid() argument
38 bool isInvalid() const { return Id == InvalidNodeId; } in isInvalid() argument
|
| /aosp_15_r20/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 31 using NodeId = typename GraphT::NodeId; in applyR1() local
75 using NodeId = typename GraphT::NodeId; in applyR2() local
181 using NodeId = GraphBase::NodeId; in backpropagate() local
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r522817/include/llvm/CodeGen/PBQP/ |
| D | ReductionRules.h | 31 using NodeId = typename GraphT::NodeId; in applyR1() local
75 using NodeId = typename GraphT::NodeId; in applyR2() local
181 using NodeId = GraphBase::NodeId; in backpropagate() local
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r536225/include/llvm/CodeGen/PBQP/ |
| D | ReductionRules.h | 31 using NodeId = typename GraphT::NodeId; in applyR1() local
75 using NodeId = typename GraphT::NodeId; in applyR2() local
181 using NodeId = GraphBase::NodeId; in backpropagate() local
|
| /aosp_15_r20/external/swiftshader/third_party/llvm-16.0/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 31 using NodeId = typename GraphT::NodeId; in applyR1() local
75 using NodeId = typename GraphT::NodeId; in applyR2() local
181 using NodeId = GraphBase::NodeId; in backpropagate() local
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567/include/llvm/CodeGen/PBQP/ |
| D | ReductionRules.h | 31 using NodeId = typename GraphT::NodeId; in applyR1() local
75 using NodeId = typename GraphT::NodeId; in applyR2() local
181 using NodeId = GraphBase::NodeId; in backpropagate() local
|