Searched refs:Leaf (Results 1 – 2 of 2) sorted by relevance
112 struct Leaf { struct116 Leaf* root_[ROOT_LENGTH]; // Pointers to 32 child nodes argument147 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); in Ensure()172 Leaf* l = reader(reinterpret_cast<Leaf*>(root_[i])); in visitValues()182 visitor.visit(root_[i], sizeof(Leaf)); in visitAllocations()206 struct Leaf { struct234 return reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3]; in get()242 reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3] = v; in set()259 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); in Ensure()287 Leaf* l = reader(reinterpret_cast<Leaf*>(n->ptrs[j])); in visitValues()[all …]
98223 ** Segment leaf nodes store terms and doclists, ordered by term. Leaf98226 ** iterate through a segment's entire leaf layer). Leaf nodes have98246 ** Leaf nodes are broken into blocks which are stored contiguously in108512 RtreeNode *pLeaf; /* Leaf on which the required cell resides */109867 RtreeNode *pLeaf; /* Leaf node containing record iDelete */