Home
last modified time | relevance | path

Searched refs:__right_ (Results 1 – 6 of 6) sorted by relevance

/external/libcxx/test/std/containers/associative/
Dtree_remove.pass.cpp23 Node* __right_; member
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {} in Node()
47 b.__right_ = &d; in test1()
52 y.__right_ = 0; in test1()
57 d.__right_ = &e; in test1()
62 c.__right_ = 0; in test1()
67 e.__right_ = 0; in test1()
75 assert(root.__right_ == 0); in test1()
80 assert(d.__right_ == &e); in test1()
85 assert(b.__right_ == &c); in test1()
[all …]
Dtree_balance_after_insert.pass.cpp23 Node* __right_; member
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {} in Node()
44 c.__right_ = &d; in test1()
49 b.__right_ = 0; in test1()
54 d.__right_ = 0; in test1()
59 a.__right_ = 0; in test1()
70 assert(c.__right_ == &d); in test1()
75 assert(b.__right_ == 0); in test1()
80 assert(d.__right_ == 0); in test1()
85 assert(a.__right_ == 0); in test1()
[all …]
Dtree_right_rotate.pass.cpp23 Node* __right_; member
26 Node() : __left_(), __right_(), __parent_() {} in Node()
37 x.__right_ = 0; in test1()
40 y.__right_ = 0; in test1()
45 assert(root.__right_ == 0); in test1()
48 assert(y.__right_ == &x); in test1()
51 assert(x.__right_ == 0); in test1()
65 x.__right_ = &c; in test2()
68 y.__right_ = &b; in test2()
76 assert(root.__right_ == 0); in test2()
[all …]
Dtree_left_rotate.pass.cpp23 Node* __right_; member
26 Node() : __left_(), __right_(), __parent_() {} in Node()
37 x.__right_ = &y; in test1()
40 y.__right_ = 0; in test1()
45 assert(root.__right_ == 0); in test1()
48 assert(y.__right_ == 0); in test1()
51 assert(x.__right_ == 0); in test1()
65 x.__right_ = &y; in test2()
68 y.__right_ = &c; in test2()
76 assert(root.__right_ == 0); in test2()
[all …]
/external/libcxx/include/
D__tree84 // 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_);
[all …]
Dmap1377 if (__nd->__right_ != nullptr)
1378 __nd = static_cast<__node_pointer>(__nd->__right_);
1382 return __parent->__right_;
1422 if (__nd->__right_ != nullptr)
1423 __nd = static_cast<__node_pointer>(__nd->__right_);
1427 return const_cast<const __node_base_const_pointer&>(__parent->__right_);