Searched refs:__right_ (Results 1 - 8 of 8) sorted by relevance

/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/libcxx/containers/associative/
H A Dtree_left_rotate.pass.cpp12 // Precondition: __x->__right_ != nullptr
23 Node* __right_; member in struct:Node
29 Node() : __left_(), __right_(), __parent_() {}
40 x.__right_ = &y;
43 y.__right_ = 0;
48 assert(root.__right_ == 0);
51 assert(y.__right_ == 0);
54 assert(x.__right_ == 0);
68 x.__right_ = &y;
71 y.__right_
[all...]
H A Dtree_right_rotate.pass.cpp23 Node* __right_; member in struct:Node
29 Node() : __left_(), __right_(), __parent_() {}
40 x.__right_ = 0;
43 y.__right_ = 0;
48 assert(root.__right_ == 0);
51 assert(y.__right_ == &x);
54 assert(x.__right_ == 0);
68 x.__right_ = &c;
71 y.__right_ = &b;
79 assert(root.__right_
[all...]
H A Dtree_remove.pass.cpp23 Node* __right_; member in struct:Node
30 Node() : __left_(), __right_(), __parent_(), __is_black_() {}
50 b.__right_ = &d;
55 y.__right_ = 0;
60 d.__right_ = &e;
65 c.__right_ = 0;
70 e.__right_ = 0;
78 assert(root.__right_ == 0);
83 assert(d.__right_ == &e);
88 assert(b.__right_
[all...]
H A Dtree_balance_after_insert.pass.cpp23 Node* __right_; member in struct:Node
30 Node() : __left_(), __right_(), __parent_(), __is_black_() {}
47 c.__right_ = &d;
52 b.__right_ = 0;
57 d.__right_ = 0;
62 a.__right_ = 0;
73 assert(c.__right_ == &d);
78 assert(b.__right_ == 0);
83 assert(d.__right_ == 0);
88 assert(a.__right_
[all...]
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/libcxx/containers/associative/
H A Dtree_left_rotate.pass.cpp12 // Precondition: __x->__right_ != nullptr
23 Node* __right_; member in struct:Node
29 Node() : __left_(), __right_(), __parent_() {}
40 x.__right_ = &y;
43 y.__right_ = 0;
48 assert(root.__right_ == 0);
51 assert(y.__right_ == 0);
54 assert(x.__right_ == 0);
68 x.__right_ = &y;
71 y.__right_
[all...]
H A Dtree_right_rotate.pass.cpp23 Node* __right_; member in struct:Node
29 Node() : __left_(), __right_(), __parent_() {}
40 x.__right_ = 0;
43 y.__right_ = 0;
48 assert(root.__right_ == 0);
51 assert(y.__right_ == &x);
54 assert(x.__right_ == 0);
68 x.__right_ = &c;
71 y.__right_ = &b;
79 assert(root.__right_
[all...]
H A Dtree_remove.pass.cpp23 Node* __right_; member in struct:Node
30 Node() : __left_(), __right_(), __parent_(), __is_black_() {}
50 b.__right_ = &d;
55 y.__right_ = 0;
60 d.__right_ = &e;
65 c.__right_ = 0;
70 e.__right_ = 0;
78 assert(root.__right_ == 0);
83 assert(d.__right_ == &e);
88 assert(b.__right_
[all...]
H A Dtree_balance_after_insert.pass.cpp23 Node* __right_; member in struct:Node
30 Node() : __left_(), __right_(), __parent_(), __is_black_() {}
47 c.__right_ = &d;
52 b.__right_ = 0;
57 d.__right_ = 0;
62 a.__right_ = 0;
73 assert(c.__right_ == &d);
78 assert(b.__right_ == 0);
83 assert(d.__right_ == 0);
88 assert(a.__right_
[all...]

Completed in 101 milliseconds