Lines Matching refs:__right_
84 // check __x->__right_ consistency
85 if (__x->__right_ != nullptr && __x->__right_->__parent_ != __x)
87 // check __x->__left_ != __x->__right_ unless both are nullptr
88 if (__x->__left_ == __x->__right_ && __x->__left_ != nullptr)
95 if (__x->__right_ && !__x->__right_->__is_black_)
101 if (__h != __tree_sub_invariant(__x->__right_))
146 while (__x->__right_ != nullptr)
147 __x = __x->__right_;
157 if (__x->__right_ != nullptr)
158 return __tree_min(__x->__right_);
190 if (__x->__right_ != nullptr)
192 __x = __x->__right_;
200 // Effects: Makes __x->__right_ the subtree root with __x as its left child
202 // Precondition: __x->__right_ != nullptr
207 _NodePtr __y = __x->__right_;
208 __x->__right_ = __y->__left_;
209 if (__x->__right_ != nullptr)
210 __x->__right_->__parent_ = __x;
215 __x->__parent_->__right_ = __y;
228 __x->__left_ = __y->__right_;
235 __x->__parent_->__right_ = __y;
236 __y->__right_ = __x;
258 _NodePtr __y = __x->__parent_->__parent_->__right_;
326 _NodePtr __y = (__z->__left_ == nullptr || __z->__right_ == nullptr) ?
329 _NodePtr __x = __y->__left_ != nullptr ? __y->__left_ : __y->__right_;
339 __w = __y->__parent_->__right_;
345 __y->__parent_->__right_ = __x;
354 // __z->__left_ != nulptr but __z->__right_ might == __x == nullptr
359 __y->__parent_->__right_ = __y;
362 __y->__right_ = __z->__right_;
363 if (__y->__right_ != nullptr)
364 __y->__right_->__parent_ = __y;
408 __w = __w->__left_->__right_;
412 (__w->__right_ == nullptr || __w->__right_->__is_black_))
424 __x->__parent_->__right_ :
430 if (__w->__right_ == nullptr || __w->__right_->__is_black_)
443 __w->__right_->__is_black_ = true;
457 if (__root == __w->__right_)
460 __w = __w->__right_->__left_;
464 (__w->__right_ == nullptr || __w->__right_->__is_black_))
476 __x->__parent_->__right_ :
485 __w->__right_->__is_black_ = true;
586 pointer __right_;
592 : __right_(), __parent_(), __is_black_(false) {}
1157 if (__cache->__right_ != nullptr)
1158 __cache = static_cast<__node_pointer>(__cache->__right_);
1160 // __cache->__right_ == nullptr
1178 if (__cache->__right_ == nullptr)
1180 return static_cast<__node_pointer>(__tree_leaf(__cache->__right_));
1183 __cache->__parent_->__right_ = nullptr;
1437 destroy(static_cast<__node_pointer>(__nd->__right_));
1495 if (__nd->__right_ != nullptr)
1496 __nd = static_cast<__node_pointer>(__nd->__right_);
1500 return __parent->__right_;
1544 if (__nd->__right_ != nullptr)
1545 __nd = static_cast<__node_pointer>(__nd->__right_);
1549 return __parent->__right_;
1585 return __parent->__right_;
1622 if (__nd->__right_ != nullptr)
1623 __nd = static_cast<__node_pointer>(__nd->__right_);
1627 return __parent->__right_;
1670 return __parent->__right_;
1683 if (__hint.__ptr_->__right_ == nullptr)
1686 return __parent->__right_;
1709 __new_node->__right_ = nullptr;
2057 __rt = static_cast<__node_const_pointer>(__rt->__right_);
2079 __rt = static_cast<__node_const_pointer>(__rt->__right_);
2083 __upper_bound(__k, static_cast<__node_const_pointer>(__rt->__right_), __result)
2104 __root = static_cast<__node_pointer>(__root->__right_);
2124 __root = static_cast<__node_const_pointer>(__root->__right_);
2144 __root = static_cast<__node_pointer>(__root->__right_);
2164 __root = static_cast<__node_const_pointer>(__root->__right_);
2186 __rt = static_cast<__node_pointer>(__rt->__right_);
2190 __rt->__right_ != nullptr ?
2191 static_cast<__node_pointer>(__tree_min(__rt->__right_))
2214 __rt = static_cast<__node_const_pointer>(__rt->__right_);
2218 __rt->__right_ != nullptr ?
2219 static_cast<__node_const_pointer>(__tree_min(__rt->__right_))
2242 __rt = static_cast<__node_pointer>(__rt->__right_);
2245 __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result));
2267 __rt = static_cast<__node_const_pointer>(__rt->__right_);
2270 … __upper_bound(__k, static_cast<__node_const_pointer>(__rt->__right_), __result));
2282 if (__np->__right_ != nullptr)
2283 __begin_node() = static_cast<__node_pointer>(__np->__right_);