141   Node* current = root_;  in FindGreatest()  local
142   while (current->right_ != nullptr) current = current->right_;  in FindGreatest()
143   locator->bind(current);  in FindGreatest()
152   Node* current = root_;  in FindLeast()  local
153   while (current->left_ != nullptr) 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_ == nullptr) break;  in Splay()
227       if (Config::Compare(key, current->left_->key_) < 0) {  in Splay()
229         Node* temp = current->left_;  in Splay()
230         current->left_ = temp->right_;  in Splay()
231         temp->right_ = current;  in Splay()
232         current = temp;  in Splay()
233         if (current->left_ == nullptr) break;  in Splay()
236       right->left_ = current;  in Splay()
237       right = current;  in Splay()
238       current = current->left_;  in Splay()
240       if (current->right_ == nullptr) break;  in Splay()
241       if (Config::Compare(key, current->right_->key_) > 0) {  in Splay()
243         Node* temp = current->right_;  in Splay()
244         current->right_ = temp->left_;  in Splay()
245         temp->left_ = current;  in Splay()
246         current = temp;  in Splay()
247         if (current->right_ == nullptr) break;  in Splay()
250       left->right_ = current;  in Splay()
251       left = current;  in Splay()
252       current = current->right_;  in Splay()
258   left->right_ = current->left_;  in Splay()
259   right->left_ = current->right_;  in Splay()
260   current->left_ = dummy->right_;  in Splay()
261   current->right_ = dummy->left_;  in Splay()
262   root_ = current;  in Splay()