Home
last modified time | relevance | path

Searched refs:m_p_max (Results 1 – 24 of 24) sorted by relevance

/NextBSD/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/
Dconstructors_destructor_fn_imps.hpp61 m_p_max(NULL) in thin_heap_()
71 m_p_max(NULL) in thin_heap_()
83 m_p_max = base_type::m_p_root; in thin_heap_()
85 if (Cmp_Fn::operator()(m_p_max->m_value, p_nd->m_value)) in thin_heap_()
86 m_p_max = p_nd; in thin_heap_()
98 std::swap(m_p_max, other.m_p_max); in swap()
Derase_fn_imps.hpp55 _GLIBCXX_DEBUG_ASSERT(m_p_max != NULL); in pop()
57 node_pointer p_nd = m_p_max; in pop()
83 while (p_add != m_p_max) in to_aux_except_max()
92 p_add = m_p_max->m_p_l_child; in to_aux_except_max()
107 p_add = m_p_max->m_p_next_sibling; in to_aux_except_max()
168 base_type::m_p_root = m_p_max = NULL; in make_from_aux()
200 m_p_max = p_nd; in remove_node()
219 m_p_max = NULL; in clear()
273 m_p_max = base_type::m_p_root = NULL; in erase_if()
Ddebug_fn_imps.hpp74 if (m_p_max == NULL) in assert_max()
81 _GLIBCXX_DEBUG_ASSERT(base_type::parent(m_p_max) == NULL); in assert_max()
82 _GLIBCXX_DEBUG_ASSERT(m_p_max->m_p_prev_or_parent == NULL); in assert_max()
84 _GLIBCXX_DEBUG_ASSERT(!Cmp_Fn::operator()(m_p_max->m_value, it.m_p_nd->m_value)); in assert_max()
Dfind_fn_imps.hpp55 _GLIBCXX_DEBUG_ASSERT(m_p_max != NULL); in top()
56 return m_p_max->m_value; in top()
Dinsert_fn_imps.hpp64 m_p_max = base_type::m_p_root = p_nd; in push()
329 if (m_p_max == NULL || Cmp_Fn::operator()(m_p_max->m_value, p_nd->m_value)) in update_max()
330 m_p_max = p_nd; in update_max()
Dsplit_join_fn_imps.hpp88 m_p_max = NULL; in split()
128 other.m_p_max = NULL; in join()
Dtrace_fn_imps.hpp56 std::cerr << "m_p_max " << m_p_max << std::endl; in trace()
Dthin_heap_.hpp277 node_pointer m_p_max; member in pb_ds::detail::thin_heap_
/NextBSD/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/
Dfind_fn_imps.hpp55 if (m_p_max == NULL) in top()
58 _GLIBCXX_DEBUG_ASSERT(m_p_max != NULL); in top()
59 return m_p_max->m_value; in top()
69 m_p_max = p_cur; in find_max()
73 if (Cmp_Fn::operator()(m_p_max->m_value, p_cur->m_value)) in find_max()
74 m_p_max = p_cur; in find_max()
Derase_fn_imps.hpp55 if (m_p_max == NULL) in pop()
58 _GLIBCXX_DEBUG_ASSERT(m_p_max != NULL); in pop()
60 node_pointer p_nd = m_p_max; in pop()
62 remove_parentless_node(m_p_max); in pop()
66 m_p_max = NULL; in pop()
102 m_p_max = NULL; in remove_parentless_node()
114 m_p_max = NULL; in clear()
131 m_p_max = NULL; in erase()
192 m_p_max = NULL; in erase_if()
Dconstructors_destructor_fn_imps.hpp62 m_p_max(NULL) in binomial_heap_base_()
71 m_p_max(NULL) in binomial_heap_base_()
80 m_p_max(NULL) in binomial_heap_base_()
94 std::swap(m_p_max, other.m_p_max); in swap()
Ddebug_fn_imps.hpp64 if (m_p_max == NULL) in assert_max()
66 _GLIBCXX_DEBUG_ASSERT(base_type::parent(m_p_max) == NULL); in assert_max()
68 _GLIBCXX_DEBUG_ASSERT(!Cmp_Fn::operator()(m_p_max->m_value, it.m_p_nd->m_value)); in assert_max()
Dinsert_fn_imps.hpp58 m_p_max = NULL; in push()
205 m_p_max = NULL; in modify()
218 m_p_max = NULL; in modify()
Dsplit_join_fn_imps.hpp121 m_p_max = NULL; in split()
150 m_p_max = NULL; in join()
154 other.m_p_max = NULL; in join()
Dbinomial_heap_base_.hpp222 node_pointer m_p_max; member in pb_ds::detail::binomial_heap_base_
/NextBSD/contrib/libstdc++/include/ext/pb_ds/detail/rc_binomial_heap_/
Dinsert_fn_imps.hpp63 if (base_type::m_p_max == NULL || Cmp_Fn::operator()(base_type::m_p_max->m_value, r_val)) in push()
64 base_type::m_p_max = p_nd; in push()
116 if (base_type::m_p_max == p_nd) in link_with_next_sibling()
117 base_type::m_p_max = p_next; in link_with_next_sibling()
131 if (base_type::m_p_max == p_next) in link_with_next_sibling()
132 base_type::m_p_max = p_nd; in link_with_next_sibling()
Ddebug_fn_imps.hpp57 _GLIBCXX_DEBUG_ASSERT(base_type::m_p_max != NULL); in assert_valid()
/NextBSD/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
Dsplit_fn_imps.hpp74 other.m_p_head->m_p_max = m_p_head->m_p_max; in split()
75 m_p_head->m_p_max = rightmost_descendant(m_p_head->m_p_parent); in split()
111 PB_DS_V2F(static_cast<const_leaf_pointer>(m_p_head->m_p_max)->value()))) in split_prep()
Dinsert_join_fn_imps.hpp70 m_p_head->m_p_max = rightmost_descendant(m_p_head->m_p_parent); in join()
91 m_p_head->m_p_max)->value()),PB_DS_V2F(static_cast<const_leaf_pointer>( in join_prep()
95 …other.m_p_head->m_p_max)->value()),PB_DS_V2F(static_cast<const_leaf_pointer>(m_p_head->m_p_min)->v… in join_prep()
468 if (m_p_head->m_p_max == m_p_head || in update_min_max_for_inserted_leaf()
469 …synth_e_access_traits::cmp_keys(PB_DS_V2F(static_cast<const_leaf_pointer>(m_p_head->m_p_max)->valu… in update_min_max_for_inserted_leaf()
470 m_p_head->m_p_max = p_new_lf; in update_min_max_for_inserted_leaf()
Ddebug_fn_imps.hpp61 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_max == m_p_head); in assert_valid()
67 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_max->m_type == pat_trie_leaf_node_type); in assert_valid()
Derase_fn_imps.hpp307 m_p_head->m_p_max = m_p_head; in update_min_max_for_erased_leaf()
319 if (p_l == static_cast<const_leaf_pointer>(m_p_head->m_p_max)) in update_min_max_for_erased_leaf()
323 m_p_head->m_p_max = it.m_p_nd; in update_min_max_for_erased_leaf()
Dconstructors_destructor_fn_imps.hpp110 m_p_head->m_p_max = rightmost_descendant(m_p_head->m_p_parent); in PB_DS_CLASS_NAME()
154 m_p_head->m_p_max = m_p_head; in initialize()
Dhead.hpp103 node_pointer m_p_max; member
Dpoint_iterators.hpp277 m_p_nd = static_cast<head_pointer>(m_p_nd)->m_p_max; in dec()