Lines Matching refs:leaf
104 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf.
147 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf)));
148 if (leaf == NULL) return false;
149 memset(leaf, 0, sizeof(*leaf));
150 root_[i1] = leaf;
153 // Advance key past whatever is covered by this leaf node
196 // How many bits should we consume at leaf level
257 // Make leaf node if necessary
259 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf)));
260 if (leaf == NULL) return false;
261 memset(leaf, 0, sizeof(*leaf));
262 root_->ptrs[i1]->ptrs[i2] = reinterpret_cast<Node*>(leaf);
265 // Advance key past whatever is covered by this leaf node