Lines Matching refs:Key
17 // typedef Key: the key type
19 // static const Key kNoKey: the dummy key used when no key is set
21 // static int (Compare)(Key& a, Key& b) -> {-1, 0, 1}: comparison function
33 typedef typename Config::Key Key;
56 // Checks if there is a mapping for the key.
57 bool Contains(const Key& key);
59 // Inserts the given key in this tree with the given value. Returns
61 // is enabled and provides access to the mapping for the key.
62 bool Insert(const Key& key, Locator* locator);
64 // Looks up the key in this tree and returns true if it was found,
66 // provides access to the mapping for the key.
67 bool Find(const Key& key, Locator* locator);
69 // Finds the mapping with the greatest key less than or equal to the
70 // given key.
71 bool FindGreatestLessThan(const Key& key, Locator* locator);
73 // Find the mapping with the greatest key in this tree.
76 // Finds the mapping with the least key greater than or equal to the
77 // given key.
78 bool FindLeastGreaterThan(const Key& key, Locator* locator);
80 // Find the mapping with the least key in this tree.
83 // Move the node from one key to another.
84 bool Move(const Key& old_key, const Key& new_key);
86 // Remove the node with the given key from the tree.
87 bool Remove(const Key& key);
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
98 void Splay(const Key& key);
102 Node(const Key& key, const Value& value)
103 : 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());
