Lines Matching defs:leaf
324 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf.
373 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf)));
374 if (leaf == NULL) return false;
375 memset(leaf, 0, sizeof(*leaf));
376 root_[i1] = leaf;
379 // Advance key past whatever is covered by this leaf node
393 Leaf* leaf = root_[i1];
394 if (leaf != NULL) {
395 // Scan forward in leaf
397 if (leaf->values[i2] != NULL) {
398 return leaf->values[i2];
417 // How many bits should we consume at leaf level
485 // Make leaf node if necessary
487 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf)));
488 if (leaf == NULL) return false;
489 memset(leaf, 0, sizeof(*leaf));
490 root_->ptrs[i1]->ptrs[i2] = reinterpret_cast<Node*>(leaf);
493 // Advance key past whatever is covered by this leaf node
510 Leaf* leaf = reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2]);
511 if (leaf != NULL) {
513 if (leaf->values[i3] != NULL) {
514 return leaf->values[i3];