Lines Matching defs:Leaf
121 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf.
128 // Leaf node
129 struct Leaf {
133 Leaf* root_[ROOT_LENGTH]; // Pointers to 32 child nodes
170 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf)));
171 if (leaf == NULL) return false;
172 memset(leaf, 0, sizeof(*leaf));
173 root_[i1] = leaf;
176 // Advance key past whatever is covered by this leaf node
190 Leaf* leaf = root_[i1];
191 if (leaf != NULL) {
192 // Scan forward in leaf
194 if (leaf->values[i2] != NULL) {
195 return leaf->values[i2];
214 // How many bits should we consume at leaf level
223 // Leaf node
224 struct Leaf {
255 return reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3];
263 reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3] = v;
282 // Make leaf node if necessary
284 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf)));
285 if (leaf == NULL) return false;
286 memset(leaf, 0, sizeof(*leaf));
287 root_->ptrs[i1]->ptrs[i2] = reinterpret_cast<Node*>(leaf);
290 // Advance key past whatever is covered by this leaf node
307 Leaf* leaf = reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2]);
308 if (leaf != NULL) {
310 if (leaf->values[i3] != NULL) {
311 return leaf->values[i3];
