139   Node* current = root_;  in FindGreatest()  local
140   while (current->right_ != NULL)  in FindGreatest()
141     current = current->right_;  in FindGreatest()
142   locator->bind(current);  in FindGreatest()
151   Node* current = root_;  in FindLeast()  local
152   while (current->left_ != NULL)  in FindLeast()
153     current = current->left_;  in FindLeast()
154   locator->bind(current);  in FindLeast()
222   Node* current = root_;  in Splay()  local
224     int cmp = Config::Compare(key, current->key_);  in Splay()
226       if (current->left_ == NULL)  in Splay()
228       if (Config::Compare(key, current->left_->key_) < 0) {  in Splay()
230         Node* temp = current->left_;  in Splay()
231         current->left_ = temp->right_;  in Splay()
232         temp->right_ = current;  in Splay()
233         current = temp;  in Splay()
234         if (current->left_ == NULL)  in Splay()
238       right->left_ = current;  in Splay()
239       right = current;  in Splay()
240       current = current->left_;  in Splay()
242       if (current->right_ == NULL)  in Splay()
244       if (Config::Compare(key, current->right_->key_) > 0) {  in Splay()
246         Node* temp = current->right_;  in Splay()
247         current->right_ = temp->left_;  in Splay()
248         temp->left_ = current;  in Splay()
249         current = temp;  in Splay()
250         if (current->right_ == NULL)  in Splay()
254       left->right_ = current;  in Splay()
255       left = current;  in Splay()
256       current = current->right_;  in Splay()
262   left->right_ = current->left_;  in Splay()
263   right->left_ = current->right_;  in Splay()
264   current->left_ = dummy->right_;  in Splay()
265   current->right_ = dummy->left_;  in Splay()
266   root_ = current;  in Splay()