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

123

/freebsd-11-stable/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),
72 node_pointer m_p_nd;
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),
81 node_pointer m_p_nd;
H A Dfind_fn_imps.hpp52 node_pointer p_pot = m_p_head;
53 node_pointer p_nd = m_p_head->m_p_parent;
75 node_pointer p_pot = m_p_head;
76 node_pointer p_nd = m_p_head->m_p_parent;
98 node_pointer p_pot = m_p_head;
99 node_pointer p_nd = m_p_head->m_p_parent;
120 node_pointer p_pot = m_p_head;
121 node_pointer p_nd = m_p_head->m_p_parent;
144 node_pointer p_pot = m_p_head;
145 node_pointer p_n
[all...]
H A Drotate_fn_imps.hpp50 rotate_left(node_pointer p_x)
52 node_pointer p_y = p_x->m_p_right;
81 rotate_right(node_pointer p_x)
83 node_pointer p_y = p_x->m_p_left;
112 rotate_parent(node_pointer p_nd)
114 node_pointer p_parent = p_nd->m_p_parent;
129 apply_update(node_pointer /*p_nd*/, null_node_update_pointer /*p_update*/)
136 apply_update(node_pointer p_nd, Node_Update_* /*p_update*/)
140 const_node_iterator(static_cast<node_pointer>(NULL)));
147 update_to_top(node_pointer p_n
[all...]
H A Dnode_iterators.hpp77 node_pointer; typedef in class:pb_ds::detail::bin_search_tree_const_node_it_
114 bin_search_tree_const_node_it_(const node_pointer p_nd = NULL) : m_p_nd(const_cast<node_pointer>(p_nd))
160 node_pointer m_p_nd;
184 node_pointer; typedef in class:pb_ds::detail::bin_search_tree_node_it_
206 bin_search_tree_node_it_(const node_pointer p_nd = NULL) : PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC(
207 const_cast<node_pointer>(p_nd))
H A Dbin_search_tree_.hpp153 typedef typename node_allocator::pointer node_pointer; typedef in class:pb_ds::detail::PB_DS_CLASS_NAME
347 insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd);
349 inline node_pointer
352 inline node_pointer
356 actual_erase_node(node_pointer p_nd);
358 inline std::pair<node_pointer, bool>
359 erase(node_pointer p_nd);
362 update_min_max_for_erased_node(node_pointer p_nd);
365 clear_imp(node_pointer p_nd);
373 rotate_left(node_pointer p_
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
H A Dnode.hpp74 node_pointer; typedef in struct:pb_ds::detail::left_child_next_sibling_heap_node_
85 node_pointer m_p_l_child;
87 node_pointer m_p_next_sibling;
89 node_pointer m_p_prev_or_parent;
112 node_pointer; typedef in struct:pb_ds::detail::left_child_next_sibling_heap_node_
119 node_pointer m_p_l_child;
121 node_pointer m_p_next_sibling;
123 node_pointer m_p_prev_or_parent;
H A Derase_fn_imps.hpp60 actual_erase_node(node_pointer p_nd)
71 clear_imp(node_pointer p_nd)
76 node_pointer p_next = p_nd->m_p_next_sibling;
88 node_pointer p_cur = m_p_root;
92 node_pointer p_child_next = p_cur->m_p_l_child->m_p_next_sibling;
115 typename PB_DS_CLASS_C_DEC::node_pointer
119 node_pointer p_cur = m_p_root;
121 node_pointer p_out = NULL;
124 node_pointer p_next = p_cur->m_p_next_sibling;
147 bubble_to_top(node_pointer p_n
[all...]
H A Dinsert_fn_imps.hpp48 inline typename PB_DS_CLASS_C_DEC::node_pointer
56 inline typename PB_DS_CLASS_C_DEC::node_pointer
60 node_pointer p_new_nd = s_node_allocator.allocate(1);
76 inline typename PB_DS_CLASS_C_DEC::node_pointer
80 node_pointer p_new_nd = s_node_allocator.allocate(1);
94 make_child_of(node_pointer p_nd, node_pointer p_new_parent)
110 inline typename PB_DS_CLASS_C_DEC::node_pointer
112 parent(node_pointer p_nd)
116 node_pointer p_po
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
H A Dupdate_fn_imps.hpp50 apply_update(node_pointer /*p_nd*/, null_node_update_pointer)
57 apply_update(node_pointer p_nd, Node_Update_* /*p_update*/)
H A Drotate_fn_imps.hpp50 rotate_left(node_pointer p_x)
52 node_pointer p_y = p_x->m_p_right;
79 rotate_right(node_pointer p_x)
81 node_pointer p_y = p_x->m_p_left;
108 rotate_parent(node_pointer p_nd)
110 node_pointer p_parent = p_nd->m_p_parent;
122 apply_update(node_pointer /*p_nd*/, pb_ds::null_node_update* /*p_update*/)
129 apply_update(node_pointer p_nd, Node_Update_* p_update)
142 update_to_top(node_pointer p_nd, Node_Update_* p_update)
154 update_to_top(node_pointer /*p_n
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/
H A Dinfo_fn_imps.hpp50 is_effectively_black(const node_pointer p_nd)
H A Dnode.hpp69 node_pointer; typedef in struct:pb_ds::detail::rb_tree_node_
102 node_pointer m_p_left;
103 node_pointer m_p_right;
104 node_pointer m_p_parent;
123 node_pointer; typedef in struct:pb_ds::detail::rb_tree_node_
135 node_pointer m_p_left;
136 node_pointer m_p_right;
137 node_pointer m_p_parent;
H A Dsplit_join_fn_imps.hpp62 const node_pointer p_x = other.split_min();
74 join_imp(node_pointer p_x, node_pointer p_r)
82 node_pointer p_x_l;
83 node_pointer p_x_r;
84 std::pair<node_pointer, node_pointer> join_pos;
105 node_pointer p_parent = join_pos.second;
138 inline typename PB_DS_CLASS_C_DEC::node_pointer
142 node_pointer p_mi
[all...]
H A Drb_tree_.hpp123 typedef typename base_type::node_pointer node_pointer; typedef in class:pb_ds::detail::PB_DS_CLASS_NAME
222 assert_node_consistent(const node_pointer) const;
226 is_effectively_black(const node_pointer);
232 insert_fixup(node_pointer);
235 erase_node(node_pointer);
238 remove_node(node_pointer);
241 remove_fixup(node_pointer, node_pointer);
244 split_imp(node_pointer, PB_DS_CLASS_C_DE
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/
H A Dnode.hpp64 node_pointer; typedef in struct:pb_ds::detail::splay_tree_node_
94 node_pointer m_p_left;
95 node_pointer m_p_right;
96 node_pointer m_p_parent;
110 node_pointer; typedef in struct:pb_ds::detail::splay_tree_node_
122 node_pointer m_p_left;
123 node_pointer m_p_right;
124 node_pointer m_p_parent;
H A Dsplay_fn_imps.hpp50 splay(node_pointer p_nd)
56 node_pointer p_head = base_type::m_p_head;
70 const node_pointer p_parent = p_nd->m_p_parent;
71 const node_pointer p_grandparent = p_parent->m_p_parent;
100 splay_zig_zag_left(node_pointer p_nd, node_pointer p_parent,
101 node_pointer p_grandparent)
113 node_pointer p_b = p_nd->m_p_right;
114 node_pointer p_c = p_nd->m_p_left;
136 splay_zig_zag_right(node_pointer p_n
[all...]
H A Dsplay_tree_.hpp145 typedef typename base_type::node_pointer node_pointer; typedef in class:pb_ds::detail::PB_DS_CLASS_NAME
244 inline node_pointer
247 inline const node_pointer
255 assert_special_imp(const node_pointer) const;
259 splay(node_pointer);
262 splay_zig_zag_left(node_pointer, node_pointer, node_pointer);
265 splay_zig_zag_right(node_pointer, node_pointe
[all...]
H A Ddebug_fn_imps.hpp55 const node_pointer p_head = base_type::m_p_head;
62 assert_special_imp(const node_pointer p_nd) const
H A Dfind_fn_imps.hpp52 node_pointer p_found = find_imp(r_key);
63 const node_pointer p_found = find_imp(r_key);
70 inline typename PB_DS_CLASS_C_DEC::node_pointer
75 node_pointer p_nd = base_type::m_p_head->m_p_parent;
89 inline const typename PB_DS_CLASS_C_DEC::node_pointer
94 node_pointer p_nd = base_type::m_p_head->m_p_parent;
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pairing_heap_/
H A Dpairing_heap_.hpp98 typedef typename base_type::node_pointer node_pointer; typedef in class:pb_ds::detail::pairing_heap_
194 push_imp(node_pointer p_nd);
196 node_pointer
197 join_node_children(node_pointer p_nd);
199 node_pointer
200 forward_join(node_pointer p_nd, node_pointer p_next);
202 node_pointer
203 back_join(node_pointer p_n
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/
H A Derase_fn_imps.hpp57 node_pointer p_nd = m_p_max;
81 node_pointer p_add = base_type::m_p_root;
85 node_pointer p_next_add = p_add->m_p_next_sibling;
96 node_pointer p_next_add = p_add->m_p_next_sibling;
111 node_pointer p_next_add = p_add->m_p_next_sibling;
122 add_to_aux(node_pointer p_nd)
152 make_child_of(node_pointer p_nd, node_pointer p_new_parent)
192 remove_node(node_pointer p_nd)
194 node_pointer p_paren
[all...]
H A Dsplit_join_fn_imps.hpp68 node_pointer p_out = base_type::prune(pred);
77 node_pointer p_next = p_out->m_p_next_sibling;
86 node_pointer p_cur = base_type::m_p_root;
94 node_pointer p_next = p_cur->m_p_next_sibling;
113 node_pointer p_other = other.m_p_root;
117 node_pointer p_next = p_other->m_p_next_sibling;
H A Dthin_heap_.hpp96 typedef typename base_type::node_pointer node_pointer; typedef in class:pb_ds::detail::thin_heap_
215 update_max(node_pointer p_nd);
218 fix(node_pointer p_nd);
221 fix_root(node_pointer p_y);
224 fix_sibling_rank_1_unmarked(node_pointer p_y);
227 fix_sibling_rank_1_marked(node_pointer p_y);
230 fix_sibling_general_unmarked(node_pointer p_y);
233 fix_sibling_general_marked(node_pointer p_y);
236 fix_child(node_pointer p_
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/
H A Dsplit_join_fn_imps.hpp68 node_pointer p_out = base_type::prune(pred);
77 node_pointer p_next = p_out->m_p_next_sibling;
97 node_pointer p_cur = base_type::m_p_root;
103 node_pointer p_next = p_cur->m_p_next_sibling;
135 node_pointer p_other = other.m_p_root;
140 node_pointer p_next = p_other->m_p_next_sibling;
161 inline typename PB_DS_CLASS_C_DEC::node_pointer
163 join(node_pointer p_lhs, node_pointer p_rhs) const
165 node_pointer p_re
[all...]

Completed in 182 milliseconds

123