Home
last modified time | relevance | path

Searched defs:Leaf (Results 1 – 25 of 127) sorted by relevance

123456

/aosp_15_r20/prebuilts/rust/linux-x86/1.81.0/lib/rustlib/src/rust/library/alloc/src/collections/btree/
H A Dnavigate.rs186 ) -> Option<Handle<NodeRef<marker::Dying, K, V, marker::Leaf>, marker::Edge>> { in take_front()
224 ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>> { in init_front()
238 ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>> { in init_back()
631 pub fn first_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in first_leaf_edge()
644 pub fn last_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in last_leaf_edge()
656 Leaf(NodeRef<BorrowType, K, V, marker::Leaf>), enumerator
712 pub fn next_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in next_leaf_edge()
725 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in next_back_leaf_edge()
742 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> in lower_bound()
765 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> in upper_bound()
H A Dremove.rs14 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_kv_tracking()
27 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_leaf_kv()
80 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_internal_kv()
H A Dnode.rs660 ) -> Handle<NodeRef<marker::Mut<'b>, K, V, marker::Leaf>, marker::KV> { in push_with_handle()
721 NodeRef<BorrowType, K, V, marker::Leaf>, in force()
742 unsafe fn cast_to_leaf_unchecked(self) -> NodeRef<marker::Mut<'a>, K, V, marker::Leaf> { in cast_to_leaf_unchecked()
914 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::KV> { in insert_fit()
940 Option<SplitResult<'a, K, V, marker::Leaf>>, in insert()
1045 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::KV> { in insert_recursing()
1220 pub fn split<A: Allocator + Clone>(mut self, alloc: A) -> SplitResult<'a, K, V, marker::Leaf> { in split()
1233 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove()
1647 Handle<NodeRef<BorrowType, K, V, marker::Leaf>, Type>, in force()
1665 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, Type> { in cast_to_leaf_unchecked()
[all …]
/aosp_15_r20/prebuilts/rust/linux-x86/1.81.0.u1/lib/rustlib/src/rust/library/alloc/src/collections/btree/
H A Dnavigate.rs186 ) -> Option<Handle<NodeRef<marker::Dying, K, V, marker::Leaf>, marker::Edge>> { in take_front()
224 ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>> { in init_front()
238 ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>> { in init_back()
631 pub fn first_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in first_leaf_edge()
644 pub fn last_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in last_leaf_edge()
656 Leaf(NodeRef<BorrowType, K, V, marker::Leaf>), enumerator
712 pub fn next_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in next_leaf_edge()
725 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in next_back_leaf_edge()
742 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> in lower_bound()
765 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> in upper_bound()
H A Dremove.rs14 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_kv_tracking()
27 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_leaf_kv()
80 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_internal_kv()
H A Dnode.rs660 ) -> Handle<NodeRef<marker::Mut<'b>, K, V, marker::Leaf>, marker::KV> { in push_with_handle()
721 NodeRef<BorrowType, K, V, marker::Leaf>, in force()
742 unsafe fn cast_to_leaf_unchecked(self) -> NodeRef<marker::Mut<'a>, K, V, marker::Leaf> { in cast_to_leaf_unchecked()
914 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::KV> { in insert_fit()
940 Option<SplitResult<'a, K, V, marker::Leaf>>, in insert()
1045 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::KV> { in insert_recursing()
1220 pub fn split<A: Allocator + Clone>(mut self, alloc: A) -> SplitResult<'a, K, V, marker::Leaf> { in split()
1233 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove()
1647 Handle<NodeRef<BorrowType, K, V, marker::Leaf>, Type>, in force()
1665 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, Type> { in cast_to_leaf_unchecked()
[all …]
/aosp_15_r20/prebuilts/rust/linux-musl-x86/1.81.0/lib/rustlib/src/rust/library/alloc/src/collections/btree/
H A Dnavigate.rs186 ) -> Option<Handle<NodeRef<marker::Dying, K, V, marker::Leaf>, marker::Edge>> { in take_front()
224 ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>> { in init_front()
238 ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>> { in init_back()
631 pub fn first_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in first_leaf_edge()
644 pub fn last_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in last_leaf_edge()
656 Leaf(NodeRef<BorrowType, K, V, marker::Leaf>), enumerator
712 pub fn next_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in next_leaf_edge()
725 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in next_back_leaf_edge()
742 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> in lower_bound()
765 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> in upper_bound()
H A Dremove.rs14 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_kv_tracking()
27 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_leaf_kv()
80 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_internal_kv()
H A Dnode.rs660 ) -> Handle<NodeRef<marker::Mut<'b>, K, V, marker::Leaf>, marker::KV> { in push_with_handle()
721 NodeRef<BorrowType, K, V, marker::Leaf>, in force()
742 unsafe fn cast_to_leaf_unchecked(self) -> NodeRef<marker::Mut<'a>, K, V, marker::Leaf> { in cast_to_leaf_unchecked()
914 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::KV> { in insert_fit()
940 Option<SplitResult<'a, K, V, marker::Leaf>>, in insert()
1045 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::KV> { in insert_recursing()
1220 pub fn split<A: Allocator + Clone>(mut self, alloc: A) -> SplitResult<'a, K, V, marker::Leaf> { in split()
1233 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove()
1647 Handle<NodeRef<BorrowType, K, V, marker::Leaf>, Type>, in force()
1665 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, Type> { in cast_to_leaf_unchecked()
[all …]
/aosp_15_r20/prebuilts/rust/linux-x86/1.80.1/lib/rustlib/src/rust/library/alloc/src/collections/btree/
H A Dnavigate.rs186 ) -> Option<Handle<NodeRef<marker::Dying, K, V, marker::Leaf>, marker::Edge>> { in take_front()
224 ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>> { in init_front()
238 ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>> { in init_back()
631 pub fn first_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in first_leaf_edge()
644 pub fn last_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in last_leaf_edge()
656 Leaf(NodeRef<BorrowType, K, V, marker::Leaf>), enumerator
712 pub fn next_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in next_leaf_edge()
725 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in next_back_leaf_edge()
742 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> in lower_bound()
765 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> in upper_bound()
H A Dremove.rs14 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_kv_tracking()
27 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_leaf_kv()
80 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_internal_kv()
H A Dnode.rs660 ) -> Handle<NodeRef<marker::Mut<'b>, K, V, marker::Leaf>, marker::KV> { in push_with_handle()
721 NodeRef<BorrowType, K, V, marker::Leaf>, in force()
742 unsafe fn cast_to_leaf_unchecked(self) -> NodeRef<marker::Mut<'a>, K, V, marker::Leaf> { in cast_to_leaf_unchecked()
914 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::KV> { in insert_fit()
940 Option<SplitResult<'a, K, V, marker::Leaf>>, in insert()
1045 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::KV> { in insert_recursing()
1220 pub fn split<A: Allocator + Clone>(mut self, alloc: A) -> SplitResult<'a, K, V, marker::Leaf> { in split()
1233 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove()
1647 Handle<NodeRef<BorrowType, K, V, marker::Leaf>, Type>, in force()
1665 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, Type> { in cast_to_leaf_unchecked()
[all …]
/aosp_15_r20/prebuilts/rust/linux-musl-x86/1.80.1/lib/rustlib/src/rust/library/alloc/src/collections/btree/
H A Dnavigate.rs186 ) -> Option<Handle<NodeRef<marker::Dying, K, V, marker::Leaf>, marker::Edge>> { in take_front()
224 ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>> { in init_front()
238 ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>> { in init_back()
631 pub fn first_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in first_leaf_edge()
644 pub fn last_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in last_leaf_edge()
656 Leaf(NodeRef<BorrowType, K, V, marker::Leaf>), enumerator
712 pub fn next_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in next_leaf_edge()
725 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> { in next_back_leaf_edge()
742 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> in lower_bound()
765 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> in upper_bound()
H A Dremove.rs14 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_kv_tracking()
27 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_leaf_kv()
80 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove_internal_kv()
H A Dnode.rs660 ) -> Handle<NodeRef<marker::Mut<'b>, K, V, marker::Leaf>, marker::KV> { in push_with_handle()
721 NodeRef<BorrowType, K, V, marker::Leaf>, in force()
742 unsafe fn cast_to_leaf_unchecked(self) -> NodeRef<marker::Mut<'a>, K, V, marker::Leaf> { in cast_to_leaf_unchecked()
914 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::KV> { in insert_fit()
940 Option<SplitResult<'a, K, V, marker::Leaf>>, in insert()
1045 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::KV> { in insert_recursing()
1220 pub fn split<A: Allocator + Clone>(mut self, alloc: A) -> SplitResult<'a, K, V, marker::Leaf> { in split()
1233 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) { in remove()
1647 Handle<NodeRef<BorrowType, K, V, marker::Leaf>, Type>, in force()
1665 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, Type> { in cast_to_leaf_unchecked()
[all …]
/aosp_15_r20/external/clang/lib/Rewrite/
H A DRewriteRope.cpp616 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this)) in Destroy() local
630 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this)) in split() local
644 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this)) in insert() local
653 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this)) in erase() local
733 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(getRoot(Root))) in clear() local
/aosp_15_r20/external/jackson-databind/src/test/java/com/fasterxml/jackson/databind/convert/
H A DTestBeanConversions.java64 static class Leaf { class in TestBeanConversions
67 public Leaf() { } in Leaf() method in TestBeanConversions.Leaf
68 public Leaf(int v) { value = v; } in Leaf() method in TestBeanConversions.Leaf
/aosp_15_r20/external/jackson-databind/src/test/java/com/fasterxml/jackson/databind/node/
H A DTestConversions.java30 static class Leaf { class in TestConversions
33 public Leaf() { } in Leaf() method in TestConversions.Leaf
34 public Leaf(int v) { value = v; } in Leaf() method in TestConversions.Leaf
/aosp_15_r20/external/bcc/examples/networking/http_filter/
H A Dhttp-parse-complete.c15 struct Leaf { struct
20 //map <Key, Leaf> argument
/aosp_15_r20/external/bcc/examples/networking/dns_matching/
H A Ddns_matching.c49 struct Leaf { struct
54 BPF_HASH(cache, struct Key, struct Leaf, 128); argument
/aosp_15_r20/external/llvm/include/llvm/DebugInfo/CodeView/
H A DCVSymbolVisitor.h88 void visitSymbolBegin(SymbolKind Leaf, ArrayRef<uint8_t> RecordData) {} in visitSymbolBegin()
89 void visitSymbolEnd(SymbolKind Leaf, ArrayRef<uint8_t> OriginalSymData) {} in visitSymbolEnd()
/aosp_15_r20/external/llvm/lib/DebugInfo/CodeView/
H A DCVTypeVisitor.cpp76 uint8_t Leaf = Data.front(); in skipPadding() local
98 TypeLeafKind Leaf = TypeLeafKind(unsigned(*LeafPtr)); in visitFieldList() local
/aosp_15_r20/external/executorch/extension/pytree/test/
H A Dtest_pytree.cpp19 using Leaf = int32_t; typedef
77 TEST(PyTreeTest, Leaf) { in TEST() argument
/aosp_15_r20/external/grpc-grpc-java/context/src/main/java/io/grpc/
H A DPersistentHashArrayMappedTrie.java58 static final class Leaf<K,V> implements Node<K,V> { class in PersistentHashArrayMappedTrie
62 public Leaf(K key, V value) { in Leaf() method in PersistentHashArrayMappedTrie.Leaf
/aosp_15_r20/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ObjectYAML/
H A DCodeViewYAMLTypes.h46 std::shared_ptr<detail::LeafRecordBase> Leaf; member

123456