Searched refs:p_nd (Results 1 - 25 of 102) sorted by relevance

12345

/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/
H A Dinfo_fn_imps.hpp46 is_effectively_black(const node_pointer p_nd) argument
47 { return (p_nd == 0 || !p_nd->m_red); }
H A Dinsert_fn_imps.hpp64 insert_fixup(node_pointer p_nd) argument
66 _GLIBCXX_DEBUG_ASSERT(p_nd->m_red == true);
67 while (p_nd != base_type::m_p_head->m_p_parent && p_nd->m_p_parent->m_red)
69 if (p_nd->m_p_parent == p_nd->m_p_parent->m_p_parent->m_p_left)
71 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right;
74 p_nd->m_p_parent->m_red = false;
76 p_nd->m_p_parent->m_p_parent->m_red = true;
77 p_nd
[all...]
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/
H A Dinfo_fn_imps.hpp46 is_effectively_black(const node_pointer p_nd) argument
47 { return (p_nd == 0 || !p_nd->m_red); }
H A Dinsert_fn_imps.hpp64 insert_fixup(node_pointer p_nd) argument
66 _GLIBCXX_DEBUG_ASSERT(p_nd->m_red == true);
67 while (p_nd != base_type::m_p_head->m_p_parent && p_nd->m_p_parent->m_red)
69 if (p_nd->m_p_parent == p_nd->m_p_parent->m_p_parent->m_p_left)
71 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right;
74 p_nd->m_p_parent->m_red = false;
76 p_nd->m_p_parent->m_p_parent->m_red = true;
77 p_nd
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dfind_fn_imps.hpp49 node_pointer p_nd = m_p_head->m_p_parent; local
51 while (p_nd != 0)
52 if (Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
53 p_nd = p_nd->m_p_right;
56 p_pot = p_nd;
57 p_nd = p_nd->m_p_left;
68 node_pointer p_nd = m_p_head->m_p_parent; local
70 while (p_nd !
87 node_pointer p_nd = m_p_head->m_p_parent; local
106 node_pointer p_nd = m_p_head->m_p_parent; local
126 node_pointer p_nd = m_p_head->m_p_parent; local
154 node_pointer p_nd = m_p_head->m_p_parent; local
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
H A Diterators_fn_imps.hpp48 node_pointer p_nd = m_p_root; local
50 if (p_nd == 0)
53 while (p_nd->m_p_l_child != 0)
54 p_nd = p_nd->m_p_l_child;
56 return (iterator(p_nd));
64 node_pointer p_nd = m_p_root; local
66 if (p_nd == 0)
69 while (p_nd->m_p_l_child != 0)
70 p_nd
[all...]
H A Dtrace_fn_imps.hpp58 trace_node(node_const_pointer p_nd, size_type level) argument
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>());
71 std::cerr << p_nd->m_value << std::endl;
72 trace_node(p_nd->m_p_l_child, level + 1);
73 p_nd
81 trace_node_metadata(node_const_pointer p_nd, type_to_type<Metadata_>) argument
[all...]
H A Dinsert_fn_imps.hpp90 make_child_of(node_pointer p_nd, node_pointer p_new_parent) argument
92 _GLIBCXX_DEBUG_ASSERT(p_nd != 0);
95 p_nd->m_p_next_sibling = p_new_parent->m_p_l_child;
98 p_new_parent->m_p_l_child->m_p_prev_or_parent = p_nd;
100 p_nd->m_p_prev_or_parent = p_new_parent;
102 p_new_parent->m_p_l_child = p_nd;
108 parent(node_pointer p_nd) argument
112 node_pointer p_pot = p_nd->m_p_prev_or_parent;
114 if (p_pot == 0 || p_pot->m_p_l_child == p_nd)
117 p_nd
124 swap_with_parent(node_pointer p_nd, node_pointer p_parent) argument
[all...]
H A Ddebug_fn_imps.hpp61 assert_node_consistent(node_const_pointer p_nd, bool single_link, argument
64 if (p_nd == 0)
67 assert_node_consistent(p_nd->m_p_l_child, false, __file, __line);
68 assert_node_consistent(p_nd->m_p_next_sibling, single_link, __file, __line);
71 PB_DS_DEBUG_VERIFY(p_nd->m_p_prev_or_parent == 0);
72 else if (p_nd->m_p_next_sibling != 0)
73 PB_DS_DEBUG_VERIFY(p_nd->m_p_next_sibling->m_p_prev_or_parent == p_nd);
75 if (p_nd->m_p_l_child == 0)
78 node_const_pointer p_child = p_nd
107 size_under_node(node_const_pointer p_nd) argument
113 size_from_node(node_const_pointer p_nd) argument
127 degree(node_const_pointer p_nd) argument
[all...]
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dfind_fn_imps.hpp49 node_pointer p_nd = m_p_head->m_p_parent; local
51 while (p_nd != 0)
52 if (Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
53 p_nd = p_nd->m_p_right;
56 p_pot = p_nd;
57 p_nd = p_nd->m_p_left;
68 node_pointer p_nd = m_p_head->m_p_parent; local
70 while (p_nd !
87 node_pointer p_nd = m_p_head->m_p_parent; local
106 node_pointer p_nd = m_p_head->m_p_parent; local
126 node_pointer p_nd = m_p_head->m_p_parent; local
154 node_pointer p_nd = m_p_head->m_p_parent; local
[all...]
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
H A Diterators_fn_imps.hpp48 node_pointer p_nd = m_p_root; local
50 if (p_nd == 0)
53 while (p_nd->m_p_l_child != 0)
54 p_nd = p_nd->m_p_l_child;
56 return (iterator(p_nd));
64 node_pointer p_nd = m_p_root; local
66 if (p_nd == 0)
69 while (p_nd->m_p_l_child != 0)
70 p_nd
[all...]
H A Dtrace_fn_imps.hpp58 trace_node(node_const_pointer p_nd, size_type level) argument
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>());
71 std::cerr << p_nd->m_value << std::endl;
72 trace_node(p_nd->m_p_l_child, level + 1);
73 p_nd
81 trace_node_metadata(node_const_pointer p_nd, type_to_type<Metadata_>) argument
[all...]
H A Dinsert_fn_imps.hpp90 make_child_of(node_pointer p_nd, node_pointer p_new_parent) argument
92 _GLIBCXX_DEBUG_ASSERT(p_nd != 0);
95 p_nd->m_p_next_sibling = p_new_parent->m_p_l_child;
98 p_new_parent->m_p_l_child->m_p_prev_or_parent = p_nd;
100 p_nd->m_p_prev_or_parent = p_new_parent;
102 p_new_parent->m_p_l_child = p_nd;
108 parent(node_pointer p_nd) argument
112 node_pointer p_pot = p_nd->m_p_prev_or_parent;
114 if (p_pot == 0 || p_pot->m_p_l_child == p_nd)
117 p_nd
124 swap_with_parent(node_pointer p_nd, node_pointer p_parent) argument
[all...]
H A Ddebug_fn_imps.hpp61 assert_node_consistent(node_const_pointer p_nd, bool single_link, argument
64 if (p_nd == 0)
67 assert_node_consistent(p_nd->m_p_l_child, false, __file, __line);
68 assert_node_consistent(p_nd->m_p_next_sibling, single_link, __file, __line);
71 PB_DS_DEBUG_VERIFY(p_nd->m_p_prev_or_parent == 0);
72 else if (p_nd->m_p_next_sibling != 0)
73 PB_DS_DEBUG_VERIFY(p_nd->m_p_next_sibling->m_p_prev_or_parent == p_nd);
75 if (p_nd->m_p_l_child == 0)
78 node_const_pointer p_child = p_nd
107 size_under_node(node_const_pointer p_nd) argument
113 size_from_node(node_const_pointer p_nd) argument
127 degree(node_const_pointer p_nd) argument
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/
H A Dinsert_fn_imps.hpp49 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
50 insert_node(p_nd);
53 return point_iterator(p_nd);
59 insert_node(node_pointer p_nd) argument
63 p_nd->m_p_next_sibling = 0;
64 p_nd->m_p_prev_or_parent = 0;
65 p_nd->m_p_l_child = 0;
66 p_nd->m_metadata = 0;
67 base_type::m_p_root = p_nd;
73 p_nd
149 node_pointer p_nd = it.m_p_nd; local
[all...]
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/
H A Dinsert_fn_imps.hpp49 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
50 insert_node(p_nd);
53 return point_iterator(p_nd);
59 insert_node(node_pointer p_nd) argument
63 p_nd->m_p_next_sibling = 0;
64 p_nd->m_p_prev_or_parent = 0;
65 p_nd->m_p_l_child = 0;
66 p_nd->m_metadata = 0;
67 base_type::m_p_root = p_nd;
73 p_nd
149 node_pointer p_nd = it.m_p_nd; local
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/
H A Dinsert_fn_imps.hpp54 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
56 p_nd->m_p_l_child = p_nd->m_p_prev_or_parent = 0;
57 p_nd->m_metadata = 0;
60 base_type::m_p_max = p_nd;
62 p_nd->m_p_next_sibling = base_type::m_p_root;
65 base_type::m_p_root->m_p_prev_or_parent = p_nd;
67 base_type::m_p_root = p_nd;
69 if (p_nd->m_p_next_sibling != 0&& p_nd
96 link_with_next_sibling(node_pointer p_nd) argument
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/
H A Dfind_fn_imps.hpp72 node_pointer p_nd = base_type::m_p_head->m_p_parent; local
73 while (p_nd != 0)
74 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
76 if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value)))
77 return p_nd;
78 p_nd = p_nd->m_p_left;
81 p_nd = p_nd->m_p_right;
91 node_pointer p_nd local
[all...]
H A Ddebug_fn_imps.hpp58 assert_special_imp(const node_pointer p_nd, argument
61 if (p_nd == 0)
64 if (p_nd == base_type::m_p_head)
66 PB_DS_DEBUG_VERIFY(p_nd->m_special);
67 assert_special_imp(p_nd->m_p_parent, __file, __line);
71 PB_DS_DEBUG_VERIFY(!p_nd->m_special);
72 assert_special_imp(p_nd->m_p_left, __file, __line);
73 assert_special_imp(p_nd->m_p_right, __file, __line);
H A Dsplay_fn_imps.hpp46 splay(node_pointer p_nd) argument
48 while (p_nd->m_p_parent != base_type::m_p_head)
57 PB_DS_ASSERT_BASE_NODE_CONSISTENT(p_nd)
59 if (p_nd->m_p_parent->m_p_parent == base_type::m_p_head)
61 base_type::rotate_parent(p_nd);
62 _GLIBCXX_DEBUG_ASSERT(p_nd == this->m_p_head->m_p_parent);
66 const node_pointer p_parent = p_nd->m_p_parent;
75 if (p_parent->m_p_left == p_nd &&
77 splay_zig_zag_left(p_nd, p_parent, p_grandparent);
78 else if (p_parent->m_p_right == p_nd
96 splay_zig_zag_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument
132 splay_zig_zag_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument
168 splay_zig_zig_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument
204 splay_zig_zig_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument
239 splay_zz_start(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument
273 splay_zz_end(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument
[all...]
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/
H A Dfind_fn_imps.hpp72 node_pointer p_nd = base_type::m_p_head->m_p_parent; local
73 while (p_nd != 0)
74 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
76 if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value)))
77 return p_nd;
78 p_nd = p_nd->m_p_left;
81 p_nd = p_nd->m_p_right;
91 node_pointer p_nd local
[all...]
H A Ddebug_fn_imps.hpp58 assert_special_imp(const node_pointer p_nd, argument
61 if (p_nd == 0)
64 if (p_nd == base_type::m_p_head)
66 PB_DS_DEBUG_VERIFY(p_nd->m_special);
67 assert_special_imp(p_nd->m_p_parent, __file, __line);
71 PB_DS_DEBUG_VERIFY(!p_nd->m_special);
72 assert_special_imp(p_nd->m_p_left, __file, __line);
73 assert_special_imp(p_nd->m_p_right, __file, __line);
H A Dsplay_fn_imps.hpp46 splay(node_pointer p_nd) argument
48 while (p_nd->m_p_parent != base_type::m_p_head)
57 PB_DS_ASSERT_BASE_NODE_CONSISTENT(p_nd)
59 if (p_nd->m_p_parent->m_p_parent == base_type::m_p_head)
61 base_type::rotate_parent(p_nd);
62 _GLIBCXX_DEBUG_ASSERT(p_nd == this->m_p_head->m_p_parent);
66 const node_pointer p_parent = p_nd->m_p_parent;
75 if (p_parent->m_p_left == p_nd &&
77 splay_zig_zag_left(p_nd, p_parent, p_grandparent);
78 else if (p_parent->m_p_right == p_nd
96 splay_zig_zag_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument
132 splay_zig_zag_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument
168 splay_zig_zig_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument
204 splay_zig_zig_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument
239 splay_zz_start(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument
273 splay_zz_end(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument
[all...]
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/
H A Dinsert_fn_imps.hpp54 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
56 p_nd->m_p_l_child = p_nd->m_p_prev_or_parent = 0;
57 p_nd->m_metadata = 0;
60 base_type::m_p_max = p_nd;
62 p_nd->m_p_next_sibling = base_type::m_p_root;
65 base_type::m_p_root->m_p_prev_or_parent = p_nd;
67 base_type::m_p_root = p_nd;
69 if (p_nd->m_p_next_sibling != 0&& p_nd
96 link_with_next_sibling(node_pointer p_nd) argument
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/
H A Ddebug_fn_imps.hpp86 assert_node_consistent(node_const_pointer p_nd, bool root, argument
89 base_type::assert_node_consistent(p_nd, root, __file, __line);
90 if (p_nd == 0)
93 assert_node_consistent(p_nd->m_p_next_sibling, root, __file, __line);
94 assert_node_consistent(p_nd->m_p_l_child, false, __file, __line);
97 if (p_nd->m_metadata == 0)
98 PB_DS_DEBUG_VERIFY(p_nd->m_p_next_sibling == 0);
100 PB_DS_DEBUG_VERIFY(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata + 1);
103 if (p_nd
[all...]

Completed in 399 milliseconds

12345