/external/libcxx/test/std/containers/associative/ |
tree_balance_after_insert.pass.cpp | 12 // Precondition: __root->__is_black_ == true 25 bool __is_black_; member in struct:Node 27 Node() : __left_(), __right_(), __parent_(), __is_black_() {} 45 c.__is_black_ = true; 50 b.__is_black_ = false; 55 d.__is_black_ = false; 60 a.__is_black_ = false; 71 assert(c.__is_black_ == true); 76 assert(b.__is_black_ == true); 81 assert(d.__is_black_ == true) [all...] |
tree_remove.pass.cpp | 25 bool __is_black_; member in struct:Node 27 Node() : __left_(), __right_(), __parent_(), __is_black_() {} 48 b.__is_black_ = true; 53 y.__is_black_ = true; 58 d.__is_black_ = false; 63 c.__is_black_ = true; 68 e.__is_black_ = true; 76 assert(root.__is_black_ == false); 81 assert(d.__is_black_ == true); 86 assert(b.__is_black_ == true) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/ |
tree_balance_after_insert.pass.cpp | 12 // Precondition: __root->__is_black_ == true 25 bool __is_black_; member in struct:Node 27 Node() : __left_(), __right_(), __parent_(), __is_black_() {} 45 c.__is_black_ = true; 50 b.__is_black_ = false; 55 d.__is_black_ = false; 60 a.__is_black_ = false; 71 assert(c.__is_black_ == true); 76 assert(b.__is_black_ == true); 81 assert(d.__is_black_ == true) [all...] |
tree_remove.pass.cpp | 25 bool __is_black_; member in struct:Node 27 Node() : __left_(), __right_(), __parent_(), __is_black_() {} 48 b.__is_black_ = true; 53 y.__is_black_ = true; 58 d.__is_black_ = false; 63 c.__is_black_ = true; 68 e.__is_black_ = true; 76 assert(root.__is_black_ == false); 81 assert(d.__is_black_ == true); 86 assert(b.__is_black_ == true) [all...] |