Home
last modified time | relevance | path

Searched refs:LeafNode (Results 1 – 6 of 6) sorted by relevance

/third_party/mindspore/mindspore/ccsrc/minddata/dataset/util/
Dbtree.h274 class LeafNode : public BaseNode {
278 using alloc_type = typename value_allocator::template rebind<LeafNode>::other;
279 Node<LeafNode> link_;
288 IndexRc Split(LeafNode *to);
292 explicit LeafNode(const value_allocator &alloc) : BaseNode::BaseNode(alloc), slotuse_(0) {} in LeafNode() function
294 ~LeafNode() = default;
305 List<LeafNode> leaf_nodes_;
318 typename LeafNode::alloc_type alloc(alloc_); in Init()
319 LeafNode *p = nullptr; in Init()
326 root_ = new (p) LeafNode(alloc_); in Init()
[all …]
Dbtree_impl.tpp115 typename BPlusTree<K, V, A, C, T>::IndexRc BPlusTree<K, V, A, C, T>::LeafNode::Sort() {
154 typename BPlusTree<K, V, A, C, T>::IndexRc BPlusTree<K, V, A, C, T>::LeafNode::Split(
155 BPlusTree<K, V, A, C, T>::LeafNode *to) {
177 typename BPlusTree<K, V, A, C, T>::IndexRc BPlusTree<K, V, A, C, T>::LeafNode::InsertIntoSlot(
237 BPlusTree<K, V, A, C, T>::LeafNode **p) {
241 typename LeafNode::alloc_type alloc(this->alloc_);
242 LeafNode *ptr = nullptr;
250 *p = new (ptr) LeafNode(alloc_);
258 …BPlusTree<K, V, A, C, T>::LockPathCB *ins_cb, BPlusTree<K, V, A, C, T>::LeafNode *node, const key_…
259 …std::unique_ptr<value_type> &&value, key_type *split_key, BPlusTree<K, V, A, C, T>::LeafNode **spl…
[all …]
Dbtree_iterator.tpp292 LeafNode *leaf = nullptr;
311 LeafNode *leaf = nullptr;
/third_party/skia/experimental/graphite/src/geom/
DIntersectionTree.cpp59 class IntersectionTree::LeafNode final : public Node { class in skgpu::IntersectionTree
65 LeafNode() { in LeafNode() function in skgpu::IntersectionTree::LeafNode
171 LeafNode* hiNode = arena->make<LeafNode>(); in split()
204 : fRoot(fArena.make<LeafNode>()) { in IntersectionTree()
207 static_assert(kLeafNodeSize == sizeof(LeafNode)); in IntersectionTree()
DIntersectionTree.h51 class LeafNode; variable
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DIntervalMap.h563 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
626 unsigned LeafNode<KeyT, ValT, N, Traits>::
935 using Leaf = IntervalMapImpl::LeafNode<KeyT, ValT, Sizer::LeafSize, Traits>;
938 using RootLeaf = IntervalMapImpl::LeafNode<KeyT, ValT, N, Traits>;