Lines Matching refs:Node
60 // true if a node was inserted, otherwise false. If found the locator
65 // otherwise false. If the node is found the locator is enabled and
83 // Move the node from one key to another.
86 // Remove the node with the given key from the tree.
94 // Perform the splay operation for the given key. Moves the node with
95 // the given key to the top of the tree. If no node has the given
96 // key, the last node on the search path is moved to the top of the
100 class Node {
102 Node(const Key& key, const Value& value)
122 Node* left() { return left_; }
123 Node* right() { return right_; }
130 Node* left_;
131 Node* right_;
134 // A locator provides access to a node in the tree without actually
135 // exposing the node.
138 explicit Locator(Node* node) : node_(node) { }
143 inline void bind(Node* node) { node_ = node; }
146 Node* node_;
157 // Search for a node with a given key. If found, root_ points
158 // to the node.
161 // Inserts a node assuming that root_ is already set up.
162 void InsertInternal(int cmp, Node* node);
164 // Removes root_ node.
172 void Call(Node* node) {
173 callback_->Call(node->key(), node->value());
185 void Call(Node* node) { AllocationPolicy::Delete(node); }
194 Node* root_;
