Searched refs:p_cur (Results 1 - 8 of 8) sorted by relevance

/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/
H A Dfind_fn_imps.hpp67 node_pointer p_cur = base_type::m_p_root; local
69 m_p_max = p_cur;
71 while (p_cur != NULL)
73 if (Cmp_Fn::operator()(m_p_max->m_value, p_cur->m_value))
74 m_p_max = p_cur;
76 p_cur = p_cur->m_p_next_sibling;
H A Dsplit_join_fn_imps.hpp97 node_pointer p_cur = base_type::m_p_root; local
101 while (p_cur != NULL)
103 node_pointer p_next = p_cur->m_p_next_sibling;
105 p_cur->m_p_l_child = p_cur->m_p_prev_or_parent = NULL;
107 p_cur->m_metadata = 0;
109 p_cur->m_p_next_sibling = base_type::m_p_root;
112 base_type::m_p_root->m_p_prev_or_parent = p_cur;
114 base_type::m_p_root = p_cur;
118 p_cur
167 node_pointer p_cur = NULL; local
[all...]
H A Derase_fn_imps.hpp168 node_pointer p_cur = base_type::m_p_root; local
172 while (p_cur != NULL)
174 node_pointer p_next = p_cur->m_p_next_sibling;
176 p_cur->m_p_l_child = p_cur->m_p_prev_or_parent = NULL;
178 p_cur->m_metadata = 0;
180 p_cur->m_p_next_sibling = base_type::m_p_root;
183 base_type::m_p_root->m_p_prev_or_parent = p_cur;
185 base_type::m_p_root = p_cur;
189 p_cur
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
H A Derase_fn_imps.hpp88 node_pointer p_cur = m_p_root; local
89 while (p_cur != NULL)
90 if (p_cur->m_p_l_child != NULL)
92 node_pointer p_child_next = p_cur->m_p_l_child->m_p_next_sibling;
93 p_cur->m_p_l_child->m_p_next_sibling = p_cur->m_p_next_sibling;
94 p_cur->m_p_next_sibling = p_cur->m_p_l_child;
95 p_cur->m_p_l_child = p_child_next;
98 p_cur
119 node_pointer p_cur = m_p_root; local
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pairing_heap_/
H A Dsplit_join_fn_imps.hpp88 node_pointer p_cur = base_type::m_p_root; local
92 while (p_cur != NULL)
94 node_pointer p_next = p_cur->m_p_next_sibling;
96 p_cur->m_p_l_child = p_cur->m_p_next_sibling = p_cur->m_p_prev_or_parent = NULL;
98 push_imp(p_cur);
100 p_cur = p_next;
H A Derase_fn_imps.hpp229 node_pointer p_cur = base_type::m_p_root; local
231 while (p_cur != NULL)
233 node_pointer p_next = p_cur->m_p_next_sibling;
234 p_cur->m_p_l_child = p_cur->m_p_next_sibling = p_cur->m_p_prev_or_parent = NULL;
236 push_imp(p_cur);
237 p_cur = p_next;
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/
H A Dsplit_join_fn_imps.hpp86 node_pointer p_cur = base_type::m_p_root; local
92 while (p_cur != NULL)
94 node_pointer p_next = p_cur->m_p_next_sibling;
96 make_root_and_link(p_cur);
98 p_cur = p_next;
H A Derase_fn_imps.hpp271 node_pointer p_cur = base_type::m_p_root; local
275 while (p_cur != NULL)
277 node_pointer p_next = p_cur->m_p_next_sibling;
279 make_root_and_link(p_cur);
281 p_cur = p_next;

Completed in 67 milliseconds