| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/splay_tree_/ |
| debug_fn_imps.hpp | 56 assert_special_imp(const node_pointer p_nd) const
58 if (p_nd == 0)
61 if (p_nd == base_type::m_p_head)
63 _GLIBCXX_DEBUG_ASSERT(p_nd->m_special);
64 assert_special_imp(p_nd->m_p_parent);
68 _GLIBCXX_DEBUG_ASSERT(!p_nd->m_special);
69 assert_special_imp(p_nd->m_p_left);
70 assert_special_imp(p_nd->m_p_right);
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/splay_tree_/ |
| debug_fn_imps.hpp | 56 assert_special_imp(const node_pointer p_nd) const
58 if (p_nd == 0)
61 if (p_nd == base_type::m_p_head)
63 _GLIBCXX_DEBUG_ASSERT(p_nd->m_special);
64 assert_special_imp(p_nd->m_p_parent);
68 _GLIBCXX_DEBUG_ASSERT(!p_nd->m_special);
69 assert_special_imp(p_nd->m_p_left);
70 assert_special_imp(p_nd->m_p_right);
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/binomial_heap_base_/ |
| insert_fn_imps.hpp | 48 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
50 insert_node(p_nd);
56 return point_iterator(p_nd);
62 insert_node(node_pointer p_nd)
66 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent =
67 p_nd->m_p_l_child = NULL;
69 p_nd->m_metadata = 0;
71 base_type::m_p_root = p_nd;
78 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = NULL
175 node_pointer p_nd = it.m_p_nd; local
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/binomial_heap_base_/ |
| insert_fn_imps.hpp | 48 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
50 insert_node(p_nd);
56 return point_iterator(p_nd);
62 insert_node(node_pointer p_nd)
66 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent =
67 p_nd->m_p_l_child = 0;
69 p_nd->m_metadata = 0;
71 base_type::m_p_root = p_nd;
78 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = 0
175 node_pointer p_nd = it.m_p_nd; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/binomial_heap_base_/ |
| insert_fn_imps.hpp | 48 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
50 insert_node(p_nd);
56 return point_iterator(p_nd);
62 insert_node(node_pointer p_nd)
66 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent =
67 p_nd->m_p_l_child = 0;
69 p_nd->m_metadata = 0;
71 base_type::m_p_root = p_nd;
78 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = 0
175 node_pointer p_nd = it.m_p_nd; local
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/ |
| insert_fn_imps.hpp | 48 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
50 insert_node(p_nd);
56 return point_iterator(p_nd);
62 insert_node(node_pointer p_nd)
66 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent =
67 p_nd->m_p_l_child = NULL;
69 p_nd->m_metadata = 0;
71 base_type::m_p_root = p_nd;
78 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = NULL
175 node_pointer p_nd = it.m_p_nd; local
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/ |
| insert_fn_imps.hpp | 48 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
50 insert_node(p_nd);
56 return point_iterator(p_nd);
62 insert_node(node_pointer p_nd)
66 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent =
67 p_nd->m_p_l_child = NULL;
69 p_nd->m_metadata = 0;
71 base_type::m_p_root = p_nd;
78 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = NULL
175 node_pointer p_nd = it.m_p_nd; local
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/ |
| insert_fn_imps.hpp | 48 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
50 insert_node(p_nd);
56 return point_iterator(p_nd);
62 insert_node(node_pointer p_nd)
66 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent =
67 p_nd->m_p_l_child = NULL;
69 p_nd->m_metadata = 0;
71 base_type::m_p_root = p_nd;
78 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = NULL
175 node_pointer p_nd = it.m_p_nd; local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/binomial_heap_base_/ |
| insert_fn_imps.hpp | 48 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
50 insert_node(p_nd);
56 return point_iterator(p_nd);
62 insert_node(node_pointer p_nd)
66 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent =
67 p_nd->m_p_l_child = NULL;
69 p_nd->m_metadata = 0;
71 base_type::m_p_root = p_nd;
78 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = NULL
175 node_pointer p_nd = it.m_p_nd; local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/binomial_heap_base_/ |
| insert_fn_imps.hpp | 48 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
50 insert_node(p_nd);
56 return point_iterator(p_nd);
62 insert_node(node_pointer p_nd)
66 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent =
67 p_nd->m_p_l_child = 0;
69 p_nd->m_metadata = 0;
71 base_type::m_p_root = p_nd;
78 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = 0
175 node_pointer p_nd = it.m_p_nd; local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/binomial_heap_base_/ |
| insert_fn_imps.hpp | 47 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
48 insert_node(p_nd);
51 return point_iterator(p_nd);
57 insert_node(node_pointer p_nd)
61 p_nd->m_p_next_sibling = 0;
62 p_nd->m_p_prev_or_parent = 0;
63 p_nd->m_p_l_child = 0;
64 p_nd->m_metadata = 0;
65 base_type::m_p_root = p_nd;
71 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = 0
147 node_pointer p_nd = it.m_p_nd; local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/binomial_heap_base_/ |
| insert_fn_imps.hpp | 48 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
50 insert_node(p_nd);
56 return point_iterator(p_nd);
62 insert_node(node_pointer p_nd)
66 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent =
67 p_nd->m_p_l_child = 0;
69 p_nd->m_metadata = 0;
71 base_type::m_p_root = p_nd;
78 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = 0
175 node_pointer p_nd = it.m_p_nd; local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/binomial_heap_base_/ |
| insert_fn_imps.hpp | 47 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
48 insert_node(p_nd);
51 return point_iterator(p_nd);
57 insert_node(node_pointer p_nd)
61 p_nd->m_p_next_sibling = 0;
62 p_nd->m_p_prev_or_parent = 0;
63 p_nd->m_p_l_child = 0;
64 p_nd->m_metadata = 0;
65 base_type::m_p_root = p_nd;
71 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = 0
147 node_pointer p_nd = it.m_p_nd; local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/binomial_heap_base_/ |
| insert_fn_imps.hpp | 47 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
48 insert_node(p_nd);
51 return point_iterator(p_nd);
57 insert_node(node_pointer p_nd)
61 p_nd->m_p_next_sibling = 0;
62 p_nd->m_p_prev_or_parent = 0;
63 p_nd->m_p_l_child = 0;
64 p_nd->m_metadata = 0;
65 base_type::m_p_root = p_nd;
71 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = 0
147 node_pointer p_nd = it.m_p_nd; local
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/thin_heap_/ |
| debug_fn_imps.hpp | 84 assert_node_consistent(const_node_pointer p_nd, bool root) const
86 base_type::assert_node_consistent(p_nd, root);
87 if (p_nd == 0)
90 assert_node_consistent(p_nd->m_p_next_sibling, root);
91 assert_node_consistent(p_nd->m_p_l_child, false);
94 if (p_nd->m_metadata == 0)
95 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling == 0);
97 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata + 1);
100 if (p_nd->m_p_l_child != 0
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/thin_heap_/ |
| debug_fn_imps.hpp | 84 assert_node_consistent(const_node_pointer p_nd, bool root) const
86 base_type::assert_node_consistent(p_nd, root);
87 if (p_nd == 0)
90 assert_node_consistent(p_nd->m_p_next_sibling, root);
91 assert_node_consistent(p_nd->m_p_l_child, false);
94 if (p_nd->m_metadata == 0)
95 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling == 0);
97 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata + 1);
100 if (p_nd->m_p_l_child != 0
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/thin_heap_/ |
| debug_fn_imps.hpp | 84 assert_node_consistent(const_node_pointer p_nd, bool root) const
86 base_type::assert_node_consistent(p_nd, root);
87 if (p_nd == 0)
90 assert_node_consistent(p_nd->m_p_next_sibling, root);
91 assert_node_consistent(p_nd->m_p_l_child, false);
94 if (p_nd->m_metadata == 0)
95 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling == 0);
97 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata + 1);
100 if (p_nd->m_p_l_child != 0
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/thin_heap_/ |
| debug_fn_imps.hpp | 84 assert_node_consistent(const_node_pointer p_nd, bool root) const
86 base_type::assert_node_consistent(p_nd, root);
87 if (p_nd == 0)
90 assert_node_consistent(p_nd->m_p_next_sibling, root);
91 assert_node_consistent(p_nd->m_p_l_child, false);
94 if (p_nd->m_metadata == 0)
95 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling == 0);
97 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata + 1);
100 if (p_nd->m_p_l_child != 0
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| trace_fn_imps.hpp | 58 trace_node(const_node_pointer p_nd, size_type level)
60 while (p_nd != NULL)
65 std::cerr << p_nd <<
66 " prev = " << p_nd->m_p_prev_or_parent <<
67 " next " << p_nd->m_p_next_sibling <<
68 " left = " << p_nd->m_p_l_child << " ";
70 trace_node_metadata(p_nd, type_to_type<node_metadata>());
72 std::cerr << p_nd->m_value << std::endl;
74 trace_node(p_nd->m_p_l_child, level + 1);
76 p_nd = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| trace_fn_imps.hpp | 58 trace_node(const_node_pointer p_nd, size_type level)
60 while (p_nd != 0)
65 std::cerr << p_nd <<
66 " prev = " << p_nd->m_p_prev_or_parent <<
67 " next " << p_nd->m_p_next_sibling <<
68 " left = " << p_nd->m_p_l_child << " ";
70 trace_node_metadata(p_nd, type_to_type<node_metadata>());
72 std::cerr << p_nd->m_value << std::endl;
74 trace_node(p_nd->m_p_l_child, level + 1);
76 p_nd = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| trace_fn_imps.hpp | 58 trace_node(const_node_pointer p_nd, size_type level)
60 while (p_nd != 0)
65 std::cerr << p_nd <<
66 " prev = " << p_nd->m_p_prev_or_parent <<
67 " next " << p_nd->m_p_next_sibling <<
68 " left = " << p_nd->m_p_l_child << " ";
70 trace_node_metadata(p_nd, type_to_type<node_metadata>());
72 std::cerr << p_nd->m_value << std::endl;
74 trace_node(p_nd->m_p_l_child, level + 1);
76 p_nd = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| trace_fn_imps.hpp | 58 trace_node(const_node_pointer p_nd, size_type level)
60 while (p_nd != NULL)
65 std::cerr << p_nd <<
66 " prev = " << p_nd->m_p_prev_or_parent <<
67 " next " << p_nd->m_p_next_sibling <<
68 " left = " << p_nd->m_p_l_child << " ";
70 trace_node_metadata(p_nd, type_to_type<node_metadata>());
72 std::cerr << p_nd->m_value << std::endl;
74 trace_node(p_nd->m_p_l_child, level + 1);
76 p_nd = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| trace_fn_imps.hpp | 58 trace_node(const_node_pointer p_nd, size_type level)
60 while (p_nd != NULL)
65 std::cerr << p_nd <<
66 " prev = " << p_nd->m_p_prev_or_parent <<
67 " next " << p_nd->m_p_next_sibling <<
68 " left = " << p_nd->m_p_l_child << " ";
70 trace_node_metadata(p_nd, type_to_type<node_metadata>());
72 std::cerr << p_nd->m_value << std::endl;
74 trace_node(p_nd->m_p_l_child, level + 1);
76 p_nd = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| trace_fn_imps.hpp | 58 trace_node(const_node_pointer p_nd, size_type level)
60 while (p_nd != NULL)
65 std::cerr << p_nd <<
66 " prev = " << p_nd->m_p_prev_or_parent <<
67 " next " << p_nd->m_p_next_sibling <<
68 " left = " << p_nd->m_p_l_child << " ";
70 trace_node_metadata(p_nd, type_to_type<node_metadata>());
72 std::cerr << p_nd->m_value << std::endl;
74 trace_node(p_nd->m_p_l_child, level + 1);
76 p_nd = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| trace_fn_imps.hpp | 58 trace_node(const_node_pointer p_nd, size_type level)
60 while (p_nd != NULL)
65 std::cerr << p_nd <<
66 " prev = " << p_nd->m_p_prev_or_parent <<
67 " next " << p_nd->m_p_next_sibling <<
68 " left = " << p_nd->m_p_l_child << " ";
70 trace_node_metadata(p_nd, type_to_type<node_metadata>());
72 std::cerr << p_nd->m_value << std::endl;
74 trace_node(p_nd->m_p_l_child, level + 1);
76 p_nd = p_nd->m_p_next_sibling
[all...] |
