Home
last modified time | relevance | path

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

/external/libcxx/test/std/containers/associative/
Dtree_remove.pass.cpp22 Node* __left_; member
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {} in Node()
43 root.__left_ = &b; in test1()
46 b.__left_ = &y; in test1()
51 y.__left_ = 0; in test1()
56 d.__left_ = &c; in test1()
61 c.__left_ = 0; in test1()
66 e.__left_ = 0; in test1()
70 std::__tree_remove(root.__left_, &y); in test1()
71 assert(std::__tree_invariant(root.__left_)); in test1()
[all …]
Dtree_balance_after_insert.pass.cpp22 Node* __left_; member
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {} in Node()
40 root.__left_ = &c; in test1()
43 c.__left_ = &b; in test1()
48 b.__left_ = &a; in test1()
53 d.__left_ = 0; in test1()
58 a.__left_ = 0; in test1()
62 std::__tree_balance_after_insert(root.__left_, &a); in test1()
64 assert(std::__tree_invariant(root.__left_)); in test1()
66 assert(root.__left_ == &c); in test1()
[all …]
Dtree_right_rotate.pass.cpp22 Node* __left_; member
26 Node() : __left_(), __right_(), __parent_() {} in Node()
35 root.__left_ = &x; in test1()
36 x.__left_ = &y; in test1()
39 y.__left_ = 0; in test1()
44 assert(root.__left_ == &y); in test1()
47 assert(y.__left_ == 0); in test1()
50 assert(x.__left_ == 0); in test1()
63 root.__left_ = &x; in test2()
64 x.__left_ = &y; in test2()
[all …]
Dtree_left_rotate.pass.cpp22 Node* __left_; member
26 Node() : __left_(), __right_(), __parent_() {} in Node()
35 root.__left_ = &x; in test1()
36 x.__left_ = 0; in test1()
39 y.__left_ = 0; in test1()
44 assert(root.__left_ == &y); in test1()
47 assert(y.__left_ == &x); in test1()
50 assert(x.__left_ == 0); in test1()
63 root.__left_ = &x; in test2()
64 x.__left_ = &a; in test2()
[all …]
/external/libcxx/include/
D__tree49 structure which has a member __left_ which points back to __root. No other
53 end_node->__left_ is an externably accessible lvalue for __root, and can be
68 return __x == __x->__parent_->__left_;
81 // check __x->__left_ consistency
82 if (__x->__left_ != nullptr && __x->__left_->__parent_ != __x)
87 // check __x->__left_ != __x->__right_ unless both are nullptr
88 if (__x->__left_ == __x->__right_ && __x->__left_ != nullptr)
93 if (__x->__left_ && !__x->__left_->__is_black_)
98 unsigned __h = __tree_sub_invariant(__x->__left_);
134 while (__x->__left_ != nullptr)
[all …]
Dmap1220 if (__nd->__left_ != nullptr)
1221 __nd = static_cast<__node_pointer>(__nd->__left_);
1225 return __parent->__left_;
1246 return __parent->__left_;
1265 if (__nd->__left_ != nullptr)
1266 __nd = static_cast<__node_pointer>(__nd->__left_);
1270 return const_cast<const __node_base_const_pointer&>(__parent->__left_);
1291 return const_cast<const __node_base_const_pointer&>(__parent->__left_);