Lines Matching refs:Key
38 // typedef Key: the key type
40 // static const kNoKey: the dummy key used when no key is set
42 // int (Compare)(Key& a, Key& b) -> {-1, 0, 1}: comparison function
54 typedef typename Config::Key Key;
67 // Inserts the given key in this tree with the given value. Returns
69 // is enabled and provides access to the mapping for the key.
70 bool Insert(const Key& key, Locator* locator);
72 // Looks up the key in this tree and returns true if it was found,
74 // provides access to the mapping for the key.
75 bool Find(const Key& key, Locator* locator);
77 // Finds the mapping with the greatest key less than or equal to the
78 // given key.
79 bool FindGreatestLessThan(const Key& key, Locator* locator);
81 // Find the mapping with the greatest key in this tree.
84 // Finds the mapping with the least key greater than or equal to the
85 // given key.
86 bool FindLeastGreaterThan(const Key& key, Locator* locator);
88 // Find the mapping with the least key in this tree.
91 // Move the node from one key to another.
92 bool Move(const Key& old_key, const Key& new_key);
94 // Remove the node with the given key from the tree.
95 bool Remove(const Key& key);
99 // Perform the splay operation for the given key. Moves the node with
100 // the given key to the top of the tree. If no node has the given
101 // key, the last node on the search path is moved to the top of the
103 void Splay(const Key& key);
107 Node(const Key& key, const Value& value)
108 : key_(key),
120 Key key() { return key_; }
128 Key key_;
140 const Key& key() { return node_->key_; }
157 // Search for a node with a given key. If found, root_ points
159 bool FindInternal(const Key& key);
165 void RemoveRootNode(const Key& key);
173 callback_->Call(node->key(), node->value());
