Home
last modified time | relevance | path

Searched refs:__parent_ (Results 1 – 5 of 5) sorted by relevance

/external/libcxx/test/std/containers/associative/
Dtree_balance_after_insert.pass.cpp24 Node* __parent_; member
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {} in Node()
42 c.__parent_ = &root; in test1()
47 b.__parent_ = &c; in test1()
52 d.__parent_ = &c; in test1()
57 a.__parent_ = &b; in test1()
68 assert(c.__parent_ == &root); in test1()
73 assert(b.__parent_ == &c); in test1()
78 assert(d.__parent_ == &c); in test1()
83 assert(a.__parent_ == &b); in test1()
[all …]
Dtree_remove.pass.cpp24 Node* __parent_; member
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {} in Node()
45 b.__parent_ = &root; in test1()
50 y.__parent_ = &b; in test1()
55 d.__parent_ = &b; in test1()
60 c.__parent_ = &d; in test1()
65 e.__parent_ = &d; in test1()
73 assert(root.__parent_ == 0); in test1()
78 assert(d.__parent_ == &root); in test1()
83 assert(b.__parent_ == &d); in test1()
[all …]
Dtree_right_rotate.pass.cpp24 Node* __parent_; member
26 Node() : __left_(), __right_(), __parent_() {} in Node()
38 x.__parent_ = &root; in test1()
41 y.__parent_ = &x; in test1()
43 assert(root.__parent_ == 0); in test1()
46 assert(y.__parent_ == &root); in test1()
49 assert(x.__parent_ == &y); in test1()
66 x.__parent_ = &root; in test2()
69 y.__parent_ = &x; in test2()
70 a.__parent_ = &y; in test2()
[all …]
Dtree_left_rotate.pass.cpp24 Node* __parent_; member
26 Node() : __left_(), __right_(), __parent_() {} in Node()
38 x.__parent_ = &root; in test1()
41 y.__parent_ = &x; in test1()
43 assert(root.__parent_ == 0); in test1()
46 assert(y.__parent_ == &root); in test1()
49 assert(x.__parent_ == &y); in test1()
66 x.__parent_ = &root; in test2()
69 y.__parent_ = &x; in test2()
70 a.__parent_ = &x; in test2()
[all …]
/external/libcxx/include/
D__tree48 Each algorithm herein assumes that __root->__parent_ points to a non-null
50 member is read or written to at __root->__parent_.
52 __root->__parent_ will be referred to below (in comments only) as end_node.
57 __root, have a non-null __parent_ field.
68 return __x == __x->__parent_->__left_;
82 if (__x->__left_ != nullptr && __x->__left_->__parent_ != __x)
85 if (__x->__right_ != nullptr && __x->__right_->__parent_ != __x)
115 // check __x->__parent_ consistency
116 if (__root->__parent_ == nullptr)
160 __x = __x->__parent_;
[all …]