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

123

/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/
H A Dinfo_fn_imps.hpp44 is_effectively_black(const node_pointer p_nd) argument
45 { return (p_nd == 0 || !p_nd->m_red); }
H A Dinsert_fn_imps.hpp62 insert_fixup(node_pointer p_nd) argument
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
[all...]
H A Ddebug_fn_imps.hpp46 assert_node_consistent(const node_pointer p_nd, const char* __file, argument
49 if (p_nd == 0)
53 assert_node_consistent(p_nd->m_p_left, __file, __line);
55 assert_node_consistent(p_nd->m_p_right, __file, __line);
56 if (p_nd->m_red)
58 PB_DS_DEBUG_VERIFY(is_effectively_black(p_nd->m_p_left));
59 PB_DS_DEBUG_VERIFY(is_effectively_black(p_nd->m_p_right));
62 return (p_nd->m_red ? 0 : 1) + l_height;
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dfind_fn_imps.hpp47 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 !
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...]
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
H A Diterators_fn_imps.hpp46 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
[all...]
H A Dtrace_fn_imps.hpp56 trace_node(node_const_pointer p_nd, size_type level) argument
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
79 trace_node_metadata(node_const_pointer p_nd, type_to_type<Metadata_>) argument
[all...]
H A Dinsert_fn_imps.hpp88 make_child_of(node_pointer p_nd, node_pointer p_new_parent) argument
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) argument
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
122 swap_with_parent(node_pointer p_nd, node_pointer p_parent) argument
[all...]
H A Ddebug_fn_imps.hpp59 assert_node_consistent(node_const_pointer p_nd, bool single_link, argument
62 if (p_nd == 0)
65 assert_node_consistent(p_nd->m_p_l_child, false, __file, __line);
66 assert_node_consistent(p_nd->m_p_next_sibling, single_link, __file, __line);
69 PB_DS_DEBUG_VERIFY(p_nd->m_p_prev_or_parent == 0);
70 else if (p_nd->m_p_next_sibling != 0)
71 PB_DS_DEBUG_VERIFY(p_nd->m_p_next_sibling->m_p_prev_or_parent == p_nd);
73 if (p_nd->m_p_l_child == 0)
76 node_const_pointer p_child = p_nd
105 size_under_node(node_const_pointer p_nd) argument
111 size_from_node(node_const_pointer p_nd) argument
125 degree(node_const_pointer p_nd) argument
[all...]
H A Derase_fn_imps.hpp54 actual_erase_node(node_pointer p_nd) argument
58 p_nd->~node();
59 s_node_allocator.deallocate(p_nd, 1);
65 clear_imp(node_pointer p_nd) argument
67 while (p_nd != 0)
69 clear_imp(p_nd->m_p_l_child);
70 node_pointer p_next = p_nd->m_p_next_sibling;
71 actual_erase_node(p_nd);
72 p_nd = p_next;
141 bubble_to_top(node_pointer p_nd) argument
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/
H A Dinsert_fn_imps.hpp47 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) argument
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
147 node_pointer p_nd = it.m_p_nd; local
[all...]
H A Ddebug_fn_imps.hpp70 assert_node_consistent(node_const_pointer p_nd, bool strictly_binomial, argument
74 base_type::assert_node_consistent(p_nd, false, __file, __line);
75 if (p_nd == 0)
77 PB_DS_DEBUG_VERIFY(p_nd->m_metadata == base_type::degree(p_nd));
78 PB_DS_DEBUG_VERIFY(base_type::size_under_node(p_nd) ==
79 static_cast<size_type>(1 << p_nd->m_metadata));
80 assert_node_consistent(p_nd->m_p_next_sibling, strictly_binomial, increasing,
82 assert_node_consistent(p_nd->m_p_l_child, true, false, __file, __line);
83 if (p_nd
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/
H A Dinsert_fn_imps.hpp56 push_imp(node_pointer p_nd) argument
58 p_nd->m_p_l_child = 0;
61 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = 0;
62 base_type::m_p_root = p_nd;
64 else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value))
66 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = 0;
67 base_type::make_child_of(base_type::m_p_root, p_nd);
68 PB_DS_ASSERT_NODE_CONSISTENT(p_nd, fals
[all...]
H A Derase_fn_imps.hpp74 remove_node(node_pointer p_nd) argument
78 node_pointer p_new_child = join_node_children(p_nd);
82 if (p_nd == base_type::m_p_root)
91 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_prev_or_parent != 0);
92 if (p_nd->m_p_prev_or_parent->m_p_l_child == p_nd)
96 p_new_child->m_p_prev_or_parent = p_nd->m_p_prev_or_parent;
97 p_new_child->m_p_next_sibling = p_nd->m_p_next_sibling;
100 p_nd->m_p_prev_or_parent->m_p_l_child = p_new_child;
101 PB_DS_ASSERT_NODE_CONSISTENT(p_nd
132 join_node_children(node_pointer p_nd) argument
149 forward_join(node_pointer p_nd, node_pointer p_next) argument
178 back_join(node_pointer p_nd, node_pointer p_next) argument
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/
H A Dinsert_fn_imps.hpp52 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
54 p_nd->m_p_l_child = p_nd->m_p_prev_or_parent = 0;
55 p_nd->m_metadata = 0;
58 base_type::m_p_max = p_nd;
60 p_nd->m_p_next_sibling = base_type::m_p_root;
63 base_type::m_p_root->m_p_prev_or_parent = p_nd;
65 base_type::m_p_root = p_nd;
67 if (p_nd->m_p_next_sibling != 0&& p_nd
94 link_with_next_sibling(node_pointer p_nd) argument
[all...]
H A Ddebug_fn_imps.hpp64 node_const_pointer p_nd = next_2_pointer(base_type::m_p_root); local
68 while (p_nd != 0)
70 PB_DS_DEBUG_VERIFY(*it == p_nd);
71 node_const_pointer p_next = p_nd->m_p_next_sibling;
73 PB_DS_DEBUG_VERIFY(p_nd->m_metadata == p_next->m_metadata);
78 p_nd = next_2_pointer(next_after_0_pointer(p_nd));
86 next_2_pointer(node_const_pointer p_nd) argument
88 if (p_nd == 0)
91 node_pointer p_next = p_nd
105 next_after_0_pointer(node_const_pointer p_nd) argument
[all...]
H A Derase_fn_imps.hpp66 node_pointer p_nd = base_type::m_p_root; local
67 while (p_nd != 0)
69 node_pointer p_next = p_nd->m_p_next_sibling;
71 p_nd = p_next;
72 else if (p_nd->m_metadata == p_next->m_metadata)
73 p_nd = link_with_next_sibling(p_nd);
74 else if (p_nd->m_metadata < p_next->m_metadata)
75 p_nd = p_next;
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/
H A Dfind_fn_imps.hpp70 node_pointer p_nd = base_type::m_p_head->m_p_parent; local
71 while (p_nd != 0)
72 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
74 if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value)))
75 return p_nd;
76 p_nd = p_nd->m_p_left;
79 p_nd = p_nd->m_p_right;
89 node_pointer p_nd local
[all...]
H A Ddebug_fn_imps.hpp56 assert_special_imp(const node_pointer p_nd, argument
59 if (p_nd == 0)
62 if (p_nd == base_type::m_p_head)
64 PB_DS_DEBUG_VERIFY(p_nd->m_special);
65 assert_special_imp(p_nd->m_p_parent, __file, __line);
69 PB_DS_DEBUG_VERIFY(!p_nd->m_special);
70 assert_special_imp(p_nd->m_p_left, __file, __line);
71 assert_special_imp(p_nd->m_p_right, __file, __line);
H A Dsplay_fn_imps.hpp44 splay(node_pointer p_nd) argument
46 while (p_nd->m_p_parent != base_type::m_p_head)
55 PB_DS_ASSERT_BASE_NODE_CONSISTENT(p_nd)
57 if (p_nd->m_p_parent->m_p_parent == base_type::m_p_head)
59 base_type::rotate_parent(p_nd);
60 _GLIBCXX_DEBUG_ASSERT(p_nd == this->m_p_head->m_p_parent);
64 const node_pointer p_parent = p_nd->m_p_parent;
73 if (p_parent->m_p_left == p_nd &&
75 splay_zig_zag_left(p_nd, p_parent, p_grandparent);
76 else if (p_parent->m_p_right == p_nd
94 splay_zig_zag_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument
130 splay_zig_zag_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument
166 splay_zig_zig_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument
202 splay_zig_zig_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument
237 splay_zz_start(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument
271 splay_zz_end(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument
[all...]
H A Dinsert_fn_imps.hpp65 node_pointer p_nd = base_type::m_p_head->m_p_parent;
68 while (p_nd != 0)
69 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), PB_DS_V2F(r_value)))
71 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), PB_DS_V2F(p_nd->m_value)))
73 return std::make_pair(point_iterator(p_nd), false);
75 p_pot = p_nd;
76 p_nd = p_nd->m_p_left;
79 p_nd = p_nd
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/
H A Ddebug_fn_imps.hpp84 assert_node_consistent(node_const_pointer p_nd, bool root, argument
87 base_type::assert_node_consistent(p_nd, root, __file, __line);
88 if (p_nd == 0)
91 assert_node_consistent(p_nd->m_p_next_sibling, root, __file, __line);
92 assert_node_consistent(p_nd->m_p_l_child, false, __file, __line);
95 if (p_nd->m_metadata == 0)
96 PB_DS_DEBUG_VERIFY(p_nd->m_p_next_sibling == 0);
98 PB_DS_DEBUG_VERIFY(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata + 1);
101 if (p_nd
[all...]
H A Dinsert_fn_imps.hpp47 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
48 p_nd->m_metadata = 0;
49 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = 0;
52 p_nd->m_p_next_sibling = 0;
53 m_p_max = base_type::m_p_root = p_nd;
55 return point_iterator(p_nd);
58 p_nd->m_p_next_sibling = base_type::m_p_root;
60 base_type::m_p_root = p_nd;
61 update_max(p_nd);
69 make_root(node_pointer p_nd) argument
78 make_root_and_link(node_pointer p_nd) argument
235 node_pointer p_nd = it.m_p_nd; local
275 update_max(node_pointer p_nd) argument
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dfind_fn_imps.hpp47 node_pointer p_nd = find_imp(r_key); local
49 if (p_nd == 0 || p_nd->m_type != leaf_node)
55 if (synth_access_traits::equal_keys(PB_DS_V2F(static_cast<leaf_pointer>(p_nd)->value()), r_key))
58 return iterator(p_nd);
72 node_const_pointer p_nd = const_cast<PB_DS_CLASS_C_DEC* >(this)->find_imp(r_key); local
74 if (p_nd == 0 || p_nd->m_type != leaf_node)
80 if (synth_access_traits::equal_keys(PB_DS_V2F(static_cast<leaf_const_pointer>(p_nd)->value()), r_key))
83 return const_iterator(const_cast<node_pointer>(p_nd));
103 node_pointer p_nd = m_p_head->m_p_parent; local
209 pref_begin(node_const_pointer p_nd) argument
221 pref_end(node_const_pointer p_nd) argument
233 leftmost_descendant(node_const_pointer p_nd) argument
243 leftmost_descendant(node_pointer p_nd) argument
253 rightmost_descendant(node_const_pointer p_nd) argument
263 rightmost_descendant(node_pointer p_nd) argument
[all...]
H A Dupdate_fn_imps.hpp51 apply_update(node_pointer p_nd, Node_Update_*) argument
53 Node_Update_::operator()(node_iterator(p_nd, this),
H A Dtrace_fn_imps.hpp58 trace_node(node_const_pointer p_nd, size_type level) argument
62 std::cerr << p_nd << " "; local
63 std::cerr << ((p_nd->m_type == pat_trie_leaf_node_type) ? "l " : "i ");
65 trace_node_metadata(p_nd, type_to_type<typename node::metadata_type>());
66 typename access_traits::const_iterator el_it = pref_begin(p_nd);
67 while (el_it != pref_end(p_nd))
73 if (p_nd->m_type == pat_trie_leaf_node_type)
79 inode_const_pointer p_internal = static_cast<inode_const_pointer>(p_nd);
99 trace_node_metadata(node_const_pointer p_nd, type_to_type<Metadata_>) argument
101 std::cerr << "(" << static_cast<unsigned long>(p_nd
[all...]

Completed in 114 milliseconds

123