| /prebuilts/go/linux-x86/src/internal/profile/ |
| D | graph.go | 206 func (em *EdgeMap) Add(e *Edge) {
210 func (em *EdgeMap) Delete(e *Edge) {
221 type Edge struct { struct
222 Src, Dest *Node
224 Weight, WeightDiv int64
228 Residual bool
230 Inline bool
235 func (e *Edge) WeightValue() int64 {
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| D | block.go | 97 type Edge struct { struct
99 b *Block
104 i int
107 func (e Edge) Block() *Block {
110 func (e Edge) Index() int {
113 func (e Edge) String() string {
|
| /prebuilts/clang/host/linux-x86/clang-r547379/python3/lib/python3.11/site-packages/pip/_vendor/rich/ |
| D | _ratio.py | 12 class Edge(Protocol): class
20 def ratio_resolve(total: int, edges: Sequence[Edge]) -> List[int]:
|
| /prebuilts/clang/host/linux-x86/clang-r530567/python3/lib/python3.11/site-packages/pip/_vendor/rich/ |
| D | _ratio.py | 12 class Edge(Protocol): class
20 def ratio_resolve(total: int, edges: Sequence[Edge]) -> List[int]:
|
| /prebuilts/clang/host/linux-x86/clang-r522817/python3/lib/python3.11/site-packages/pip/_vendor/rich/ |
| D | _ratio.py | 12 class Edge(Protocol): class
20 def ratio_resolve(total: int, edges: Sequence[Edge]) -> List[int]:
|
| /prebuilts/clang/host/linux-x86/clang-r536225/python3/lib/python3.11/site-packages/pip/_vendor/rich/ |
| D | _ratio.py | 12 class Edge(Protocol): class
20 def ratio_resolve(total: int, edges: Sequence[Edge]) -> List[int]:
|
| /prebuilts/rust/linux-musl-x86/1.83.0/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
| D | remove.rs | 17 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_kv_tracking()
30 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_leaf_kv()
83 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_internal_kv()
|
| D | search.rs | 39 Edge(usize), enumerator
94 Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>, in search_tree_for_bifurcation()
162 ) -> (Handle<Self, marker::Edge>, SearchBound<&'r Q>) in find_lower_bound_edge()
176 ) -> (Handle<Self, marker::Edge>, SearchBound<&'r Q>) in find_upper_bound_edge()
|
| D | navigate.rs | 105 Edge(Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>), enumerator
185 ) -> Option<Handle<NodeRef<marker::Dying, K, V, marker::Leaf>, marker::Edge>> { in take_front()
223 ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>> { in init_front()
237 ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>> { in init_back()
630 pub fn first_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in first_leaf_edge()
643 pub fn last_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in last_leaf_edge()
711 pub fn next_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in next_leaf_edge()
724 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in next_back_leaf_edge()
|
| D | node.rs | 320 ) -> Result<Handle<NodeRef<BorrowType, K, V, marker::Internal>, marker::Edge>, Self> { in ascend()
338 pub fn first_edge(self) -> Handle<Self, marker::Edge> { in first_edge()
342 pub fn last_edge(self) -> Handle<Self, marker::Edge> { in last_edge()
399 ) -> Option<Handle<NodeRef<marker::Dying, K, V, marker::Internal>, marker::Edge>> { in deallocate_and_ascend()
798 pub fn left_edge(self) -> Handle<NodeRef<BorrowType, K, V, NodeType>, marker::Edge> { in left_edge()
802 pub fn right_edge(self) -> Handle<NodeRef<BorrowType, K, V, NodeType>, marker::Edge> { in right_edge()
1233 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove()
1451 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::LeafOrInternal>, marker::Edge> { in merge_tracking_child_edge()
1473 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::LeafOrInternal>, marker::Edge> { in steal_left()
1485 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::LeafOrInternal>, marker::Edge> { in steal_right()
[all …]
|
| /prebuilts/rust/linux-x86/1.83.0/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
| D | remove.rs | 17 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_kv_tracking()
30 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_leaf_kv()
83 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_internal_kv()
|
| D | search.rs | 39 Edge(usize), enumerator
94 Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>, in search_tree_for_bifurcation()
162 ) -> (Handle<Self, marker::Edge>, SearchBound<&'r Q>) in find_lower_bound_edge()
176 ) -> (Handle<Self, marker::Edge>, SearchBound<&'r Q>) in find_upper_bound_edge()
|
| D | navigate.rs | 105 Edge(Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>), enumerator
185 ) -> Option<Handle<NodeRef<marker::Dying, K, V, marker::Leaf>, marker::Edge>> { in take_front()
223 ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>> { in init_front()
237 ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>> { in init_back()
630 pub fn first_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in first_leaf_edge()
643 pub fn last_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in last_leaf_edge()
711 pub fn next_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in next_leaf_edge()
724 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in next_back_leaf_edge()
|
| /prebuilts/rust/linux-musl-x86/1.82.0/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
| D | remove.rs | 17 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_kv_tracking()
30 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_leaf_kv()
83 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_internal_kv()
|
| D | search.rs | 39 Edge(usize), enumerator
94 Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>, in search_tree_for_bifurcation()
162 ) -> (Handle<Self, marker::Edge>, SearchBound<&'r Q>) in find_lower_bound_edge()
176 ) -> (Handle<Self, marker::Edge>, SearchBound<&'r Q>) in find_upper_bound_edge()
|
| D | navigate.rs | 105 Edge(Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>), enumerator
185 ) -> Option<Handle<NodeRef<marker::Dying, K, V, marker::Leaf>, marker::Edge>> { in take_front()
223 ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>> { in init_front()
237 ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>> { in init_back()
630 pub fn first_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in first_leaf_edge()
643 pub fn last_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in last_leaf_edge()
711 pub fn next_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in next_leaf_edge()
724 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in next_back_leaf_edge()
|
| D | node.rs | 320 ) -> Result<Handle<NodeRef<BorrowType, K, V, marker::Internal>, marker::Edge>, Self> { in ascend()
338 pub fn first_edge(self) -> Handle<Self, marker::Edge> { in first_edge()
342 pub fn last_edge(self) -> Handle<Self, marker::Edge> { in last_edge()
399 ) -> Option<Handle<NodeRef<marker::Dying, K, V, marker::Internal>, marker::Edge>> { in deallocate_and_ascend()
798 pub fn left_edge(self) -> Handle<NodeRef<BorrowType, K, V, NodeType>, marker::Edge> { in left_edge()
802 pub fn right_edge(self) -> Handle<NodeRef<BorrowType, K, V, NodeType>, marker::Edge> { in right_edge()
1233 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove()
1451 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::LeafOrInternal>, marker::Edge> { in merge_tracking_child_edge()
1473 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::LeafOrInternal>, marker::Edge> { in steal_left()
1485 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::LeafOrInternal>, marker::Edge> { in steal_right()
[all …]
|
| /prebuilts/rust/linux-x86/1.82.0/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
| D | remove.rs | 17 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_kv_tracking()
30 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_leaf_kv()
83 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_internal_kv()
|
| D | search.rs | 39 Edge(usize), enumerator
94 Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>, in search_tree_for_bifurcation()
162 ) -> (Handle<Self, marker::Edge>, SearchBound<&'r Q>) in find_lower_bound_edge()
176 ) -> (Handle<Self, marker::Edge>, SearchBound<&'r Q>) in find_upper_bound_edge()
|
| D | navigate.rs | 105 Edge(Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>), enumerator
185 ) -> Option<Handle<NodeRef<marker::Dying, K, V, marker::Leaf>, marker::Edge>> { in take_front()
223 ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>> { in init_front()
237 ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>> { in init_back()
630 pub fn first_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in first_leaf_edge()
643 pub fn last_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in last_leaf_edge()
711 pub fn next_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in next_leaf_edge()
724 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in next_back_leaf_edge()
|
| /prebuilts/go/linux-x86/src/cmd/vendor/github.com/google/pprof/internal/graph/ |
| D | graph.go | 256 type Edge struct { struct
257 Src, Dest *Node
259 Weight, WeightDiv int64
263 Residual bool
265 Inline bool
270 func (e *Edge) WeightValue() int64 {
915 func isRedundantEdge(e *Edge) bool {
|
| /prebuilts/clang/host/linux-x86/clang-r522817/include/llvm/ADT/ |
| D | SCCIterator.h | 276 bool unionGroups(const EdgeType *Edge) { in unionGroups()
351 for (const auto *Edge : MSTEdges) in scc_member_iterator() local
|
| /prebuilts/clang/host/linux-x86/clang-r547379/include/llvm/ADT/ |
| D | SCCIterator.h | 276 bool unionGroups(const EdgeType *Edge) { in unionGroups()
351 for (const auto *Edge : MSTEdges) in scc_member_iterator() local
|
| /prebuilts/clang/host/linux-x86/clang-r536225/include/llvm/ADT/ |
| D | SCCIterator.h | 276 bool unionGroups(const EdgeType *Edge) { in unionGroups()
351 for (const auto *Edge : MSTEdges) in scc_member_iterator() local
|
| /prebuilts/clang/host/linux-x86/clang-r530567/include/llvm/ADT/ |
| D | SCCIterator.h | 276 bool unionGroups(const EdgeType *Edge) { in unionGroups()
351 for (const auto *Edge : MSTEdges) in scc_member_iterator() local
|