Lines Matching full:node
111 // Leaf node
145 // Make 2nd level node if necessary
153 // Advance key past whatever is covered by this leaf node
200 // Interior node
201 struct Node {
202 Node* ptrs[INTERIOR_LENGTH];
205 // Leaf node
210 Node* root_; // Root of radix tree
213 Node* NewNode() {
214 Node* result = reinterpret_cast<Node*>((*allocator_)(sizeof(Node)));
250 // Make 2nd level node if necessary
252 Node* n = NewNode();
257 // Make leaf node if necessary
262 root_->ptrs[i1]->ptrs[i2] = reinterpret_cast<Node*>(leaf);
265 // Advance key past whatever is covered by this leaf node
277 Node* root = reader(root_);
282 Node* n = reader(root->ptrs[i]);
296 visitor.visit(root_, sizeof(Node));
298 Node* root = reader(root_);
303 visitor.visit(root->ptrs[i], sizeof(Node));
304 Node* n = reader(root->ptrs[i]);
