HomeSort by relevance Sort by last modified time
    Searched refs:__parent_ (Results 1 - 8 of 8) sorted by null

  /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...]

Completed in 221 milliseconds