| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/ |
| tree_left_rotate.pass.cpp | 12 // Precondition: __x->__right_ != nullptr
23 Node* __right_; member in struct:Node
26 Node() : __left_(), __right_(), __parent_() {}
37 x.__right_ = &y;
40 y.__right_ = 0;
45 assert(root.__right_ == 0);
48 assert(y.__right_ == 0);
51 assert(x.__right_ == 0);
65 x.__right_ = &y;
68 y.__right_ = &c
[all...] |
| tree_remove.pass.cpp | 23 Node* __right_; member in struct:Node
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {}
47 b.__right_ = &d;
52 y.__right_ = 0;
57 d.__right_ = &e;
62 c.__right_ = 0;
67 e.__right_ = 0;
75 assert(root.__right_ == 0);
80 assert(d.__right_ == &e);
85 assert(b.__right_ == &c)
[all...] |
| tree_right_rotate.pass.cpp | 23 Node* __right_; member in struct:Node
26 Node() : __left_(), __right_(), __parent_() {}
37 x.__right_ = 0;
40 y.__right_ = 0;
45 assert(root.__right_ == 0);
48 assert(y.__right_ == &x);
51 assert(x.__right_ == 0);
65 x.__right_ = &c;
68 y.__right_ = &b;
76 assert(root.__right_ == 0)
[all...] |
| tree_balance_after_insert.pass.cpp | 23 Node* __right_; member in struct:Node
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {}
44 c.__right_ = &d;
49 b.__right_ = 0;
54 d.__right_ = 0;
59 a.__right_ = 0;
70 assert(c.__right_ == &d);
75 assert(b.__right_ == 0);
80 assert(d.__right_ == 0);
85 assert(a.__right_ == 0)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| __tree | 84 // 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_;
[all...] |
| map | [all...] |
