Lines Matching defs:Key
40 // typedef Key: the key type
42 // static const kNoKey: the dummy key used when no key is set
44 // int (Compare)(Key& a, Key& b) -> {-1, 0, 1}: comparison function
56 typedef typename Config::Key Key;
69 // Inserts the given key in this tree with the given value. Returns
71 // is enabled and provides access to the mapping for the key.
72 bool Insert(const Key& key, Locator* locator);
74 // Looks up the key in this tree and returns true if it was found,
76 // provides access to the mapping for the key.
77 bool Find(const Key& key, Locator* locator);
79 // Finds the mapping with the greatest key less than or equal to the
80 // given key.
81 bool FindGreatestLessThan(const Key& key, Locator* locator);
83 // Find the mapping with the greatest key in this tree.
86 // Finds the mapping with the least key greater than or equal to the
87 // given key.
88 bool FindLeastGreaterThan(const Key& key, Locator* locator);
90 // Find the mapping with the least key in this tree.
93 // Move the node from one key to another.
94 bool Move(const Key& old_key, const Key& new_key);
96 // Remove the node with the given key from the tree.
97 bool Remove(const Key& key);
101 // Perform the splay operation for the given key. Moves the node with
102 // the given key to the top of the tree. If no node has the given
103 // key, the last node on the search path is moved to the top of the
105 void Splay(const Key& key);
109 Node(const Key& key, const Value& value)
110 : key_(key),
122 Key key() { return key_; }
130 Key key_;
142 const Key& key() { return node_->key_; }
159 // Search for a node with a given key. If found, root_ points
161 bool FindInternal(const Key& key);
167 void RemoveRootNode(const Key& key);
175 callback_->Call(node->key(), node->value());
