| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/rb_tree_map_/ |
| info_fn_imps.hpp | 44 is_effectively_black(const node_pointer p_nd)
45 { return (p_nd == 0 || !p_nd->m_red); }
|
| insert_fn_imps.hpp | 62 insert_fixup(node_pointer p_nd)
64 _GLIBCXX_DEBUG_ASSERT(p_nd->m_red == true);
65 while (p_nd != base_type::m_p_head->m_p_parent && p_nd->m_p_parent->m_red)
67 if (p_nd->m_p_parent == p_nd->m_p_parent->m_p_parent->m_p_left)
69 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right;
72 p_nd->m_p_parent->m_red = false;
74 p_nd->m_p_parent->m_p_parent->m_red = true;
75 p_nd = p_nd->m_p_parent->m_p_parent
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/rb_tree_map_/ |
| info_fn_imps.hpp | 44 is_effectively_black(const node_pointer p_nd)
45 { return (p_nd == 0 || !p_nd->m_red); }
|
| insert_fn_imps.hpp | 62 insert_fixup(node_pointer p_nd)
64 _GLIBCXX_DEBUG_ASSERT(p_nd->m_red == true);
65 while (p_nd != base_type::m_p_head->m_p_parent && p_nd->m_p_parent->m_red)
67 if (p_nd->m_p_parent == p_nd->m_p_parent->m_p_parent->m_p_left)
69 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right;
72 p_nd->m_p_parent->m_red = false;
74 p_nd->m_p_parent->m_p_parent->m_red = true;
75 p_nd = p_nd->m_p_parent->m_p_parent
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/rb_tree_map_/ |
| info_fn_imps.hpp | 44 is_effectively_black(const node_pointer p_nd)
45 { return (p_nd == 0 || !p_nd->m_red); }
|
| insert_fn_imps.hpp | 62 insert_fixup(node_pointer p_nd)
64 _GLIBCXX_DEBUG_ASSERT(p_nd->m_red == true);
65 while (p_nd != base_type::m_p_head->m_p_parent && p_nd->m_p_parent->m_red)
67 if (p_nd->m_p_parent == p_nd->m_p_parent->m_p_parent->m_p_left)
69 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right;
72 p_nd->m_p_parent->m_red = false;
74 p_nd->m_p_parent->m_p_parent->m_red = true;
75 p_nd = p_nd->m_p_parent->m_p_parent
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/rb_tree_map_/ |
| info_fn_imps.hpp | 44 is_effectively_black(const node_pointer p_nd)
45 { return (p_nd == 0 || !p_nd->m_red); }
|
| insert_fn_imps.hpp | 62 insert_fixup(node_pointer p_nd)
64 _GLIBCXX_DEBUG_ASSERT(p_nd->m_red == true);
65 while (p_nd != base_type::m_p_head->m_p_parent && p_nd->m_p_parent->m_red)
67 if (p_nd->m_p_parent == p_nd->m_p_parent->m_p_parent->m_p_left)
69 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right;
72 p_nd->m_p_parent->m_red = false;
74 p_nd->m_p_parent->m_p_parent->m_red = true;
75 p_nd = p_nd->m_p_parent->m_p_parent
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/bin_search_tree_/ |
| find_fn_imps.hpp | 47 node_pointer p_nd = m_p_head->m_p_parent; local
49 while (p_nd != 0)
50 if (Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
51 p_nd = p_nd->m_p_right;
54 p_pot = p_nd;
55 p_nd = p_nd->m_p_left;
66 node_pointer p_nd = m_p_head->m_p_parent; local
68 while (p_nd != 0
85 node_pointer p_nd = m_p_head->m_p_parent; local
104 node_pointer p_nd = m_p_head->m_p_parent; local
124 node_pointer p_nd = m_p_head->m_p_parent; local
152 node_pointer p_nd = m_p_head->m_p_parent; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| iterators_fn_imps.hpp | 46 node_pointer p_nd = m_p_root; local
48 if (p_nd == 0)
51 while (p_nd->m_p_l_child != 0)
52 p_nd = p_nd->m_p_l_child;
54 return (iterator(p_nd));
62 node_pointer p_nd = m_p_root; local
64 if (p_nd == 0)
67 while (p_nd->m_p_l_child != 0)
68 p_nd = p_nd->m_p_l_child
[all...] |
| trace_fn_imps.hpp | 56 trace_node(node_const_pointer p_nd, size_type level)
58 while (p_nd != 0)
63 std::cerr << p_nd <<
64 " prev = " << p_nd->m_p_prev_or_parent <<
65 " next " << p_nd->m_p_next_sibling <<
66 " left = " << p_nd->m_p_l_child << " ";
68 trace_node_metadata(p_nd, type_to_type<node_metadata>());
69 std::cerr << p_nd->m_value << std::endl;
70 trace_node(p_nd->m_p_l_child, level + 1);
71 p_nd = p_nd->m_p_next_sibling
[all...] |
| insert_fn_imps.hpp | 88 make_child_of(node_pointer p_nd, node_pointer p_new_parent)
90 _GLIBCXX_DEBUG_ASSERT(p_nd != 0);
93 p_nd->m_p_next_sibling = p_new_parent->m_p_l_child;
96 p_new_parent->m_p_l_child->m_p_prev_or_parent = p_nd;
98 p_nd->m_p_prev_or_parent = p_new_parent;
100 p_new_parent->m_p_l_child = p_nd;
106 parent(node_pointer p_nd)
110 node_pointer p_pot = p_nd->m_p_prev_or_parent;
112 if (p_pot == 0 || p_pot->m_p_l_child == p_nd)
115 p_nd = p_pot
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/bin_search_tree_/ |
| find_fn_imps.hpp | 47 node_pointer p_nd = m_p_head->m_p_parent; local
49 while (p_nd != 0)
50 if (Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
51 p_nd = p_nd->m_p_right;
54 p_pot = p_nd;
55 p_nd = p_nd->m_p_left;
66 node_pointer p_nd = m_p_head->m_p_parent; local
68 while (p_nd != 0
85 node_pointer p_nd = m_p_head->m_p_parent; local
104 node_pointer p_nd = m_p_head->m_p_parent; local
124 node_pointer p_nd = m_p_head->m_p_parent; local
152 node_pointer p_nd = m_p_head->m_p_parent; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| iterators_fn_imps.hpp | 46 node_pointer p_nd = m_p_root; local
48 if (p_nd == 0)
51 while (p_nd->m_p_l_child != 0)
52 p_nd = p_nd->m_p_l_child;
54 return (iterator(p_nd));
62 node_pointer p_nd = m_p_root; local
64 if (p_nd == 0)
67 while (p_nd->m_p_l_child != 0)
68 p_nd = p_nd->m_p_l_child
[all...] |
| trace_fn_imps.hpp | 56 trace_node(node_const_pointer p_nd, size_type level)
58 while (p_nd != 0)
63 std::cerr << p_nd <<
64 " prev = " << p_nd->m_p_prev_or_parent <<
65 " next " << p_nd->m_p_next_sibling <<
66 " left = " << p_nd->m_p_l_child << " ";
68 trace_node_metadata(p_nd, type_to_type<node_metadata>());
69 std::cerr << p_nd->m_value << std::endl;
70 trace_node(p_nd->m_p_l_child, level + 1);
71 p_nd = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/bin_search_tree_/ |
| find_fn_imps.hpp | 47 node_pointer p_nd = m_p_head->m_p_parent; local
49 while (p_nd != 0)
50 if (Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
51 p_nd = p_nd->m_p_right;
54 p_pot = p_nd;
55 p_nd = p_nd->m_p_left;
66 node_pointer p_nd = m_p_head->m_p_parent; local
68 while (p_nd != 0
85 node_pointer p_nd = m_p_head->m_p_parent; local
104 node_pointer p_nd = m_p_head->m_p_parent; local
124 node_pointer p_nd = m_p_head->m_p_parent; local
152 node_pointer p_nd = m_p_head->m_p_parent; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| iterators_fn_imps.hpp | 46 node_pointer p_nd = m_p_root; local
48 if (p_nd == 0)
51 while (p_nd->m_p_l_child != 0)
52 p_nd = p_nd->m_p_l_child;
54 return (iterator(p_nd));
62 node_pointer p_nd = m_p_root; local
64 if (p_nd == 0)
67 while (p_nd->m_p_l_child != 0)
68 p_nd = p_nd->m_p_l_child
[all...] |
| trace_fn_imps.hpp | 56 trace_node(node_const_pointer p_nd, size_type level)
58 while (p_nd != 0)
63 std::cerr << p_nd <<
64 " prev = " << p_nd->m_p_prev_or_parent <<
65 " next " << p_nd->m_p_next_sibling <<
66 " left = " << p_nd->m_p_l_child << " ";
68 trace_node_metadata(p_nd, type_to_type<node_metadata>());
69 std::cerr << p_nd->m_value << std::endl;
70 trace_node(p_nd->m_p_l_child, level + 1);
71 p_nd = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/bin_search_tree_/ |
| find_fn_imps.hpp | 47 node_pointer p_nd = m_p_head->m_p_parent; local
49 while (p_nd != 0)
50 if (Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
51 p_nd = p_nd->m_p_right;
54 p_pot = p_nd;
55 p_nd = p_nd->m_p_left;
66 node_pointer p_nd = m_p_head->m_p_parent; local
68 while (p_nd != 0
85 node_pointer p_nd = m_p_head->m_p_parent; local
104 node_pointer p_nd = m_p_head->m_p_parent; local
124 node_pointer p_nd = m_p_head->m_p_parent; local
152 node_pointer p_nd = m_p_head->m_p_parent; local
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| iterators_fn_imps.hpp | 46 node_pointer p_nd = m_p_root; local
48 if (p_nd == 0)
51 while (p_nd->m_p_l_child != 0)
52 p_nd = p_nd->m_p_l_child;
54 return (iterator(p_nd));
62 node_pointer p_nd = m_p_root; local
64 if (p_nd == 0)
67 while (p_nd->m_p_l_child != 0)
68 p_nd = p_nd->m_p_l_child
[all...] |
| trace_fn_imps.hpp | 56 trace_node(node_const_pointer p_nd, size_type level)
58 while (p_nd != 0)
63 std::cerr << p_nd <<
64 " prev = " << p_nd->m_p_prev_or_parent <<
65 " next " << p_nd->m_p_next_sibling <<
66 " left = " << p_nd->m_p_l_child << " ";
68 trace_node_metadata(p_nd, type_to_type<node_metadata>());
69 std::cerr << p_nd->m_value << std::endl;
70 trace_node(p_nd->m_p_l_child, level + 1);
71 p_nd = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/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/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/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/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/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/current/sources/cxx-stl/gnu-libstdc++/4.9/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...] |
