Lines Matching defs:leaf
104 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf.
111 // Leaf node
112 struct Leaf {
116 Leaf* root_[ROOT_LENGTH]; // Pointers to 32 child nodes
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
172 Leaf* l = reader(reinterpret_cast<Leaf*>(root_[i]));
182 visitor.visit(root_[i], sizeof(Leaf));
196 // How many bits should we consume at leaf level
205 // Leaf node
206 struct Leaf {
234 return reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3];
242 reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3] = v;
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
287 Leaf* l = reader(reinterpret_cast<Leaf*>(n->ptrs[j]));
309 visitor.visit(n->ptrs[j], sizeof(Leaf));
