155   Node* current = root_;  in FindGreatest()  local
156   while (current->right_ != NULL)  in FindGreatest()
157     current = current->right_;  in FindGreatest()
158   locator->bind(current);  in FindGreatest()
167   Node* current = root_;  in FindLeast()  local
168   while (current->left_ != NULL)  in FindLeast()
169     current = current->left_;  in FindLeast()
170   locator->bind(current);  in FindLeast()
238   Node* current = root_;  in Splay()  local
240     int cmp = Config::Compare(key, current->key_);  in Splay()
242       if (current->left_ == NULL)  in Splay()
244       if (Config::Compare(key, current->left_->key_) < 0) {  in Splay()
246         Node* temp = current->left_;  in Splay()
247         current->left_ = temp->right_;  in Splay()
248         temp->right_ = current;  in Splay()
249         current = temp;  in Splay()
250         if (current->left_ == NULL)  in Splay()
254       right->left_ = current;  in Splay()
255       right = current;  in Splay()
256       current = current->left_;  in Splay()
258       if (current->right_ == NULL)  in Splay()
260       if (Config::Compare(key, current->right_->key_) > 0) {  in Splay()
262         Node* temp = current->right_;  in Splay()
263         current->right_ = temp->left_;  in Splay()
264         temp->left_ = current;  in Splay()
265         current = temp;  in Splay()
266         if (current->right_ == NULL)  in Splay()
270       left->right_ = current;  in Splay()
271       left = current;  in Splay()
272       current = current->right_;  in Splay()
278   left->right_ = current->left_;  in Splay()
279   right->left_ = current->right_;  in Splay()
280   current->left_ = dummy->right_;  in Splay()
281   current->right_ = dummy->left_;  in Splay()
282   root_ = current;  in Splay()