| /external/libcxx/test/std/containers/associative/ |
| tree_left_rotate.pass.cpp | 24 Node* __parent_; member in struct:Node
26 Node() : __left_(), __right_(), __parent_() {}
38 x.__parent_ = &root;
41 y.__parent_ = &x;
43 assert(root.__parent_ == 0);
46 assert(y.__parent_ == &root);
49 assert(x.__parent_ == &y);
66 x.__parent_ = &root;
69 y.__parent_ = &x;
70 a.__parent_ = &x
[all...] |
| tree_right_rotate.pass.cpp | 24 Node* __parent_; member in struct:Node
26 Node() : __left_(), __right_(), __parent_() {}
38 x.__parent_ = &root;
41 y.__parent_ = &x;
43 assert(root.__parent_ == 0);
46 assert(y.__parent_ == &root);
49 assert(x.__parent_ == &y);
66 x.__parent_ = &root;
69 y.__parent_ = &x;
70 a.__parent_ = &y
[all...] |
| tree_balance_after_insert.pass.cpp | 24 Node* __parent_; member in struct:Node
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {}
42 c.__parent_ = &root;
47 b.__parent_ = &c;
52 d.__parent_ = &c;
57 a.__parent_ = &b;
68 assert(c.__parent_ == &root);
73 assert(b.__parent_ == &c);
78 assert(d.__parent_ == &c);
83 assert(a.__parent_ == &b)
[all...] |
| tree_remove.pass.cpp | 24 Node* __parent_; member in struct:Node
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {}
45 b.__parent_ = &root;
50 y.__parent_ = &b;
55 d.__parent_ = &b;
60 c.__parent_ = &d;
65 e.__parent_ = &d;
73 assert(root.__parent_ == 0);
78 assert(d.__parent_ == &root);
83 assert(b.__parent_ == &d)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/ |
| tree_left_rotate.pass.cpp | 24 Node* __parent_; member in struct:Node
26 Node() : __left_(), __right_(), __parent_() {}
38 x.__parent_ = &root;
41 y.__parent_ = &x;
43 assert(root.__parent_ == 0);
46 assert(y.__parent_ == &root);
49 assert(x.__parent_ == &y);
66 x.__parent_ = &root;
69 y.__parent_ = &x;
70 a.__parent_ = &x
[all...] |
| tree_right_rotate.pass.cpp | 24 Node* __parent_; member in struct:Node
26 Node() : __left_(), __right_(), __parent_() {}
38 x.__parent_ = &root;
41 y.__parent_ = &x;
43 assert(root.__parent_ == 0);
46 assert(y.__parent_ == &root);
49 assert(x.__parent_ == &y);
66 x.__parent_ = &root;
69 y.__parent_ = &x;
70 a.__parent_ = &y
[all...] |
| tree_balance_after_insert.pass.cpp | 24 Node* __parent_; member in struct:Node
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {}
42 c.__parent_ = &root;
47 b.__parent_ = &c;
52 d.__parent_ = &c;
57 a.__parent_ = &b;
68 assert(c.__parent_ == &root);
73 assert(b.__parent_ == &c);
78 assert(d.__parent_ == &c);
83 assert(a.__parent_ == &b)
[all...] |
| tree_remove.pass.cpp | 24 Node* __parent_; member in struct:Node
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {}
45 b.__parent_ = &root;
50 y.__parent_ = &b;
55 d.__parent_ = &b;
60 c.__parent_ = &d;
65 e.__parent_ = &d;
73 assert(root.__parent_ == 0);
78 assert(d.__parent_ == &root);
83 assert(b.__parent_ == &d)
[all...] |
| /external/libcxx/include/ |
| __tree | 48 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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| __tree | 48 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...] |
| /prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| __tree | 48 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...] |
