Searched refs:__root (Results 1 – 4 of 4) sorted by relevance
134 if (__x == __root) in _Rb_tree_rotate_left()135 __root = __y; in _Rb_tree_rotate_left()146 _Rb_tree_node_base*& __root) in _Rb_tree_rotate_right() argument155 if (__x == __root) in _Rb_tree_rotate_right()156 __root = __y; in _Rb_tree_rotate_right()203 while (__x != __root in _Rb_tree_insert_and_rebalance()295 if (__root == __z) in _Rb_tree_rebalance_for_erase()296 __root = __y; in _Rb_tree_rebalance_for_erase()311 if (__root == __z) in _Rb_tree_rebalance_for_erase()312 __root = __x; in _Rb_tree_rebalance_for_erase()[all …]
52 algorithms taking a parameter named __root should assume that __root114 // __root == nullptr is a proper tree. Returns true is __root is a proper265 // __x == __root or == a direct or indirect child of __root.2673 __root = static_cast<__node_pointer>(__root->__left_);2676 __root = static_cast<__node_pointer>(__root->__right_);2693 __root = static_cast<__node_pointer>(__root->__left_);2696 __root = static_cast<__node_pointer>(__root->__right_);2713 __root = static_cast<__node_pointer>(__root->__left_);2716 __root = static_cast<__node_pointer>(__root->__right_);2733 __root = static_cast<__node_pointer>(__root->__left_);[all …]
312 _Rb_tree_node_base*& __root);316 _Rb_tree_node_base*& __root);1534 const _Rb_tree_node_base* __root);
1079 _Rope_iterator_base(_RopeRep* __root, size_t __pos)1080 : _M_current_pos(__pos), _M_root(__root), _M_buf_ptr(0) { }1113 _Rope_const_iterator(const _RopeRep* __root, size_t __pos)1114 : _Rope_iterator_base<_CharT, _Alloc>(const_cast<_RopeRep*>(__root),