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

12

/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/bin_search_tree_/
H A Dcond_dtor_entry_dealtor.hpp51 bin_search_tree_cond_dtor_entry_dealtor_(node_pointer p_nd) : m_p_nd(p_nd),
68 deallocate(m_p_nd, 1);
72 node_pointer m_p_nd; member in class:bin_search_tree_cond_dtor_entry_dealtor_
H A Dcond_key_dtor_entry_dealtor.hpp51 bin_seach_tree_cond_key_dtor_entry_dealtor_(node_pointer p_nd) : m_p_nd(p_nd),
75 m_p_nd->m_value.first.~Key();
77 bin_tree_base::s_alloc.deallocate(m_p_nd, 1);
81 node_pointer m_p_nd; member in class:bin_seach_tree_cond_key_dtor_entry_dealtor_
H A Dpoint_iterators.hpp134 : m_p_nd(const_cast<Node_Pointer>(p_nd))
139 : m_p_nd(other.m_p_nd)
146 m_p_nd = other.m_p_nd;
154 m_p_nd = other.m_p_nd;
161 _GLIBCXX_DEBUG_ASSERT(m_p_nd != NULL);
162 return &m_p_nd->m_value;
168 _GLIBCXX_DEBUG_ASSERT(m_p_nd !
286 Node_Pointer m_p_nd; member in class:pb_ds::detail::bin_search_tree_const_it_
319 base_it_type::m_p_nd = other.m_p_nd; member in class:pb_ds::detail::bin_search_tree_it_::base_it_type
327 base_it_type::m_p_nd = other.m_p_nd; member in class:pb_ds::detail::bin_search_tree_it_::base_it_type
[all...]
H A Dnode_iterators.hpp114 bin_search_tree_const_node_it_(const node_pointer p_nd = NULL) : m_p_nd(const_cast<node_pointer>(p_nd))
121 return (Const_Iterator(m_p_nd));
128 return (m_p_nd->get_metadata());
135 return (PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC(m_p_nd->m_p_left));
142 return (PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC(m_p_nd->m_p_right));
149 return (m_p_nd == other.m_p_nd);
156 return (m_p_nd != other.m_p_nd);
160 node_pointer m_p_nd; member in class:pb_ds::detail::bin_search_tree_const_node_it_
[all...]
H A Ddebug_fn_imps.hpp217 _GLIBCXX_DEBUG_ASSERT(lower_bound(PB_DS_V2F(*it)).m_p_nd == it.m_p_nd);
220 _GLIBCXX_DEBUG_ASSERT(upper_bound_it.m_p_nd == it.m_p_nd);
236 PB_DS_V2F(*reverse_it)).m_p_nd == reverse_it.m_p_nd);
240 _GLIBCXX_DEBUG_ASSERT(upper_bound_it.m_p_nd == reverse_it.m_p_nd);
H A Derase_fn_imps.hpp80 m_p_head->m_p_left = it.m_p_nd;
88 m_p_head->m_p_right = it.m_p_nd;
H A Dr_erase_fn_imps.hpp80 m_p_head->m_p_left = it.m_p_nd;
88 m_p_head->m_p_right = it.m_p_nd;
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
H A Dconst_iterator.hpp117 { return (base_type::m_p_nd == other.m_p_nd); }
122 { return (base_type::m_p_nd != other.m_p_nd); }
127 _GLIBCXX_DEBUG_ASSERT(base_type::m_p_nd != NULL);
135 PB_DS_CLASS_C_DEC ret_it(base_type::m_p_nd);
144 if (base_type::m_p_nd->m_p_next_sibling != NULL)
146 base_type::m_p_nd = base_type::m_p_nd->m_p_next_sibling; member in class:pb_ds::detail::left_child_next_sibling_heap_const_iterator_::base_type
147 while (base_type::m_p_nd
148 base_type::m_p_nd = base_type::m_p_nd->m_p_l_child; member in class:pb_ds::detail::left_child_next_sibling_heap_const_iterator_::base_type
155 base_type::m_p_nd = base_type::m_p_nd->m_p_prev_or_parent; member in class:pb_ds::detail::left_child_next_sibling_heap_const_iterator_::base_type
[all...]
H A Dconst_point_iterator.hpp111 left_child_next_sibling_heap_node_const_point_iterator_(node_pointer p_nd) : m_p_nd(p_nd)
116 left_child_next_sibling_heap_node_const_point_iterator_() : m_p_nd(NULL)
121 left_child_next_sibling_heap_node_const_point_iterator_(const PB_DS_CLASS_C_DEC& other) : m_p_nd(other.m_p_nd)
128 _GLIBCXX_DEBUG_ASSERT(m_p_nd != NULL);
129 return &m_p_nd->m_value;
136 _GLIBCXX_DEBUG_ASSERT(m_p_nd != NULL);
137 return m_p_nd->m_value;
143 { return m_p_nd == other.m_p_nd; }
151 node_pointer m_p_nd; member in class:pb_ds::detail::left_child_next_sibling_heap_node_const_point_iterator_
[all...]
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
H A Dcond_dtor_entry_dealtor.hpp51 cond_dealtor(leaf_pointer p_nd) : m_p_nd(p_nd),
75 m_p_nd->~leaf();
77 s_leaf_allocator.deallocate(m_p_nd, 1);
81 leaf_pointer m_p_nd; member in class:cond_dealtor
H A Dpoint_iterators.hpp154 pat_trie_const_it_(node_pointer p_nd = NULL) : m_p_nd(p_nd)
159 : m_p_nd(other.m_p_nd)
166 m_p_nd = other.m_p_nd;
174 m_p_nd = other.m_p_nd;
181 _GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == pat_trie_leaf_node_type);
182 return &static_cast<leaf_pointer>(m_p_nd)->value();
188 _GLIBCXX_DEBUG_ASSERT(m_p_nd
353 node_pointer m_p_nd; member in class:pb_ds::detail::pat_trie_const_it_
417 base_it_type::m_p_nd = other.m_p_nd; member in class:pb_ds::detail::pat_trie_it_::base_it_type
425 base_it_type::m_p_nd = other.m_p_nd; member in class:pb_ds::detail::pat_trie_it_::base_it_type
[all...]
H A Dnode_iterators.hpp125 if (m_p_nd->m_type == pat_trie_leaf_node_type)
128 static_cast<const_leaf_pointer>(m_p_nd)->value())));
130 _GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == pat_trie_internal_node_type);
132 return (static_cast<const_internal_node_pointer>(m_p_nd)->pref_b_it());
138 if (m_p_nd->m_type == pat_trie_leaf_node_type)
141 static_cast<const_leaf_pointer>(m_p_nd)->value())));
143 _GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == pat_trie_internal_node_type);
145 return (static_cast<const_internal_node_pointer>(m_p_nd)->pref_e_it());
191 : m_p_nd(const_cast<node_pointer>(p_nd)), m_p_traits(p_traits)
205 return Const_Iterator(m_p_nd);
251 node_pointer m_p_nd; member in class:pb_ds::detail::pat_trie_const_node_it_
[all...]
H A Derase_fn_imps.hpp185 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == pat_trie_leaf_node_type);
186 erase_leaf(static_cast<leaf_pointer>(it.m_p_nd));
203 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == pat_trie_leaf_node_type);
204 erase_leaf(static_cast<leaf_pointer>(it.m_p_nd));
217 if (it.m_p_nd == m_p_head)
222 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == pat_trie_leaf_node_type);
223 erase_leaf(static_cast<leaf_pointer>(it.m_p_nd));
236 if (it.m_p_nd == m_p_head)
241 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == pat_trie_leaf_node_type);
242 erase_leaf(static_cast<leaf_pointer>(it.m_p_nd));
[all...]
H A Dr_erase_fn_imps.hpp74 m_p_head->m_p_left = it.m_p_nd;
80 m_p_head->m_p_right = it.m_p_nd;
H A Ddebug_fn_imps.hpp98 _GLIBCXX_DEBUG_ASSERT(p_nd == it.m_p_nd);
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/pairing_heap_/
H A Dinsert_fn_imps.hpp99 remove_node(it.m_p_nd);
101 it.m_p_nd->m_value = r_new_val;
103 push_imp(it.m_p_nd);
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/
H A Dinsert_fn_imps.hpp54 ins_pair.first.m_p_nd->m_special = false;
56 splay(ins_pair.first.m_p_nd);
H A Derase_fn_imps.hpp69 erase_node(it.m_p_nd);
80 if (it.m_p_nd == base_type::m_p_head)
84 erase_node(it.m_p_nd);
H A Dsplit_join_fn_imps.hpp98 node_pointer p_upper_bound = upper_bound(r_key).m_p_nd;
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/
H A Derase_fn_imps.hpp125 base_type::bubble_to_top(it.m_p_nd);
127 remove_parentless_node(it.m_p_nd);
129 base_type::actual_erase_node(it.m_p_nd);
H A Ddebug_fn_imps.hpp68 _GLIBCXX_DEBUG_ASSERT(!Cmp_Fn::operator()(m_p_max->m_value, it.m_p_nd->m_value));
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/
H A Dinsert_fn_imps.hpp56 ins_pair.first.m_p_nd->m_red = true;
58 insert_fixup(ins_pair.first.m_p_nd);
H A Derase_fn_imps.hpp70 erase_node(it.m_p_nd);
81 if (it.m_p_nd == base_type::m_p_head)
86 erase_node(it.m_p_nd);
H A Drb_tree_.hpp182 ins_pair.first.m_p_nd->m_red = true;
184 insert_fixup(ins_pair.first.m_p_nd);
187 return ins_pair.first.m_p_nd->m_value.second;
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/
H A Ddebug_fn_imps.hpp84 _GLIBCXX_DEBUG_ASSERT(!Cmp_Fn::operator()(m_p_max->m_value, it.m_p_nd->m_value));

Completed in 145 milliseconds

12