| /external/libcxx/test/std/containers/associative/ |
| tree_left_rotate.pass.cpp | 22 Node* __left_; member in struct:Node
26 Node() : __left_(), __right_(), __parent_() {}
35 root.__left_ = &x;
36 x.__left_ = 0;
39 y.__left_ = 0;
44 assert(root.__left_ == &y);
47 assert(y.__left_ == &x);
50 assert(x.__left_ == 0);
63 root.__left_ = &x;
64 x.__left_ = &a
[all...] |
| tree_right_rotate.pass.cpp | 12 // Precondition: __x->__left_ != nullptr
22 Node* __left_; member in struct:Node
26 Node() : __left_(), __right_(), __parent_() {}
35 root.__left_ = &x;
36 x.__left_ = &y;
39 y.__left_ = 0;
44 assert(root.__left_ == &y);
47 assert(y.__left_ == 0);
50 assert(x.__left_ == 0);
63 root.__left_ = &x
[all...] |
| tree_remove.pass.cpp | 22 Node* __left_; member in struct:Node
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {}
43 root.__left_ = &b;
46 b.__left_ = &y;
51 y.__left_ = 0;
56 d.__left_ = &c;
61 c.__left_ = 0;
66 e.__left_ = 0;
70 std::__tree_remove(root.__left_, &y);
71 assert(std::__tree_invariant(root.__left_));
[all...] |
| tree_balance_after_insert.pass.cpp | 22 Node* __left_; member in struct:Node
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {}
40 root.__left_ = &c;
43 c.__left_ = &b;
48 b.__left_ = &a;
53 d.__left_ = 0;
58 a.__left_ = 0;
62 std::__tree_balance_after_insert(root.__left_, &a);
64 assert(std::__tree_invariant(root.__left_));
66 assert(root.__left_ == &c)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/ |
| tree_left_rotate.pass.cpp | 22 Node* __left_; member in struct:Node
26 Node() : __left_(), __right_(), __parent_() {}
35 root.__left_ = &x;
36 x.__left_ = 0;
39 y.__left_ = 0;
44 assert(root.__left_ == &y);
47 assert(y.__left_ == &x);
50 assert(x.__left_ == 0);
63 root.__left_ = &x;
64 x.__left_ = &a
[all...] |
| tree_right_rotate.pass.cpp | 12 // Precondition: __x->__left_ != nullptr
22 Node* __left_; member in struct:Node
26 Node() : __left_(), __right_(), __parent_() {}
35 root.__left_ = &x;
36 x.__left_ = &y;
39 y.__left_ = 0;
44 assert(root.__left_ == &y);
47 assert(y.__left_ == 0);
50 assert(x.__left_ == 0);
63 root.__left_ = &x
[all...] |
| tree_remove.pass.cpp | 22 Node* __left_; member in struct:Node
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {}
43 root.__left_ = &b;
46 b.__left_ = &y;
51 y.__left_ = 0;
56 d.__left_ = &c;
61 c.__left_ = 0;
66 e.__left_ = 0;
70 std::__tree_remove(root.__left_, &y);
71 assert(std::__tree_invariant(root.__left_));
[all...] |
| tree_balance_after_insert.pass.cpp | 22 Node* __left_; member in struct:Node
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {}
40 root.__left_ = &c;
43 c.__left_ = &b;
48 b.__left_ = &a;
53 d.__left_ = 0;
58 a.__left_ = 0;
62 std::__tree_balance_after_insert(root.__left_, &a);
64 assert(std::__tree_invariant(root.__left_));
66 assert(root.__left_ == &c)
[all...] |
