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

/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/
H A Dsplit_join_fn_imps.hpp74 node_pointer p_cur = base_type::m_p_root;
75 base_type::m_p_root = 0; member in class:base_type
97 if (other.m_p_root == 0)
104 if (base_type::m_p_root == 0)
105 base_type::m_p_root = other.m_p_root; member in class:base_type
106 else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, other.m_p_root->m_value))
108 base_type::make_child_of(base_type::m_p_root, other.m_p_root);
110 base_type::m_p_root = other.m_p_root; member in class:base_type
[all...]
H A Ddebug_fn_imps.hpp48 PB_DS_DEBUG_VERIFY(base_type::m_p_root == 0
49 || base_type::m_p_root->m_p_next_sibling == 0);
H A Dinsert_fn_imps.hpp59 if (base_type::m_p_root == 0)
62 base_type::m_p_root = p_nd; member in class:base_type
64 else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value))
67 base_type::make_child_of(base_type::m_p_root, p_nd);
69 base_type::m_p_root = p_nd; member in class:base_type
73 base_type::make_child_of(p_nd, base_type::m_p_root);
74 PB_DS_ASSERT_NODE_CONSISTENT(base_type::m_p_root, false)
H A Dfind_fn_imps.hpp48 return base_type::m_p_root->m_value;
H A Derase_fn_imps.hpp49 node_pointer p_new_root = join_node_children(base_type::m_p_root);
54 base_type::actual_erase_node(base_type::m_p_root);
55 base_type::m_p_root = p_new_root; member in class:base_type
82 if (p_nd == base_type::m_p_root)
86 base_type::m_p_root = p_new_child; member in class:base_type
87 PB_DS_ASSERT_NODE_CONSISTENT(base_type::m_p_root, false)
220 node_pointer p_cur = base_type::m_p_root;
221 base_type::m_p_root = 0; member in class:base_type
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
H A Derase_fn_imps.hpp46 clear_imp(m_p_root);
48 m_p_root = 0;
82 node_pointer p_cur = m_p_root;
95 node_const_pointer p_counter = m_p_root;
113 node_pointer p_cur = m_p_root;
114 m_p_root = 0;
128 p_cur->m_p_next_sibling = m_p_root;
129 if (m_p_root != 0)
130 m_p_root->m_p_prev_or_parent = p_cur;
131 m_p_root
[all...]
H A Dconstructors_destructor_fn_imps.hpp52 m_p_root(0),
62 m_p_root(0),
71 : Cmp_Fn(other), m_p_root(0), m_size(0)
75 m_p_root = recursive_copy_node(other.m_p_root);
98 std::swap(m_p_root, other.m_p_root);
H A Diterators_fn_imps.hpp46 node_pointer p_nd = m_p_root;
62 node_pointer p_nd = m_p_root;
H A Ddebug_fn_imps.hpp48 PB_DS_DEBUG_VERIFY(m_p_root == 0 || m_p_root->m_p_prev_or_parent == 0);
50 if (m_p_root != 0)
51 assert_node_consistent(m_p_root, Single_Link_Roots, __file, __line);
99 PB_DS_DEBUG_VERIFY(size_from_node(m_p_root) == m_size);
H A Dtrace_fn_imps.hpp49 trace_node(m_p_root, 0);
H A Dinsert_fn_imps.hpp124 if (p_parent == m_p_root)
125 m_p_root = p_nd;
H A Dleft_child_next_sibling_heap_.hpp267 node_pointer m_p_root; member in class:__gnu_pbds::detail::left_child_next_sibling_heap
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/
H A Dinsert_fn_imps.hpp59 if (base_type::m_p_root == 0)
65 base_type::m_p_root = p_nd; member in class:base_type
69 if (base_type::m_p_root->m_metadata > 0)
72 p_nd->m_p_next_sibling = base_type::m_p_root;
73 base_type::m_p_root->m_p_prev_or_parent = p_nd;
74 base_type::m_p_root = p_nd; member in class:base_type
79 if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value))
81 p_nd->m_p_next_sibling = base_type::m_p_root->m_p_next_sibling;
84 p_nd->m_p_l_child = base_type::m_p_root;
85 base_type::m_p_root
87 base_type::m_p_root = p_nd; member in class:base_type
100 base_type::m_p_root = fix(base_type::m_p_root); member in class:base_type
166 base_type::m_p_root = p_nd; member in class:base_type
[all...]
H A Dsplit_join_fn_imps.hpp70 p_out->m_p_next_sibling = other.m_p_root;
71 if (other.m_p_root != 0)
72 other.m_p_root->m_p_prev_or_parent = p_out;
74 other.m_p_root = p_out;
75 other.m_p_root = other.fix(other.m_p_root);
80 node_pointer p_cur = base_type::m_p_root;
81 base_type::m_p_root = 0; member in class:base_type
88 p_cur->m_p_next_sibling = base_type::m_p_root;
90 if (base_type::m_p_root !
93 base_type::m_p_root = p_cur; member in class:base_type
94 base_type::m_p_root = fix(base_type::m_p_root); member in class:base_type
121 base_type::m_p_root = join(base_type::m_p_root, other.m_p_root); member in class:base_type
[all...]
H A Derase_fn_imps.hpp68 node_pointer p_cur_root = p_nd == base_type::m_p_root?
69 p_nd->m_p_next_sibling : base_type::m_p_root;
89 base_type::m_p_root = join(p_cur_root, p_child); member in class:base_type
141 node_pointer p_cur = base_type::m_p_root;
142 base_type::m_p_root = 0; member in class:base_type
148 p_cur->m_p_next_sibling = base_type::m_p_root;
150 if (base_type::m_p_root != 0)
151 base_type::m_p_root->m_p_prev_or_parent = p_cur;
153 base_type::m_p_root = p_cur; member in class:base_type
154 base_type::m_p_root member in class:base_type
[all...]
H A Dfind_fn_imps.hpp61 node_pointer p_cur = base_type::m_p_root;
H A Ddebug_fn_imps.hpp49 assert_node_consistent(base_type::m_p_root, strictly_binomial, true,
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/
H A Dsplit_join_fn_imps.hpp72 node_pointer p_cur = base_type::m_p_root;
74 base_type::m_p_root = 0; member in class:base_type
94 node_pointer p_other = other.m_p_root;
102 other.m_p_root = 0;
H A Dinsert_fn_imps.hpp50 if (base_type::m_p_root == 0)
53 m_p_max = base_type::m_p_root = p_nd;
58 p_nd->m_p_next_sibling = base_type::m_p_root;
59 base_type::m_p_root->m_p_prev_or_parent = 0;
60 base_type::m_p_root = p_nd; member in class:base_type
82 p_nd->m_p_next_sibling = base_type::m_p_root;
83 if (base_type::m_p_root != 0)
84 base_type::m_p_root->m_p_prev_or_parent = 0;
86 base_type::m_p_root = p_nd; member in class:base_type
H A Dconstructors_destructor_fn_imps.hpp75 m_p_max = base_type::m_p_root;
76 for (node_pointer p_nd = base_type::m_p_root; p_nd != 0;
H A Derase_fn_imps.hpp70 node_pointer p_add = base_type::m_p_root;
142 base_type::m_p_root = m_p_max = 0; member in class:base_type
170 node_pointer p_fix = base_type::m_p_root;
227 node_pointer p_cur = base_type::m_p_root;
228 m_p_max = base_type::m_p_root = 0;
H A Ddebug_fn_imps.hpp49 assert_node_consistent(base_type::m_p_root, true, __file, __line);
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/
H A Dinsert_fn_imps.hpp60 p_nd->m_p_next_sibling = base_type::m_p_root;
62 if (base_type::m_p_root != 0)
63 base_type::m_p_root->m_p_prev_or_parent = p_nd;
65 base_type::m_p_root = p_nd; member in class:base_type
106 base_type::m_p_root = p_next; member in class:base_type
H A Ddebug_fn_imps.hpp60 PB_DS_DEBUG_VERIFY(next_2_pointer(base_type::m_p_root) == 0);
64 node_const_pointer p_nd = next_2_pointer(base_type::m_p_root);
H A Derase_fn_imps.hpp66 node_pointer p_nd = base_type::m_p_root;

Completed in 121 milliseconds