Home
last modified time | relevance | path

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

/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/
Derase_fn_imps.hpp136 p_x = p_y->m_p_right; in remove_node()
137 else if (p_y->m_p_right == NULL) in remove_node()
141 p_y = p_y->m_p_right; in remove_node()
144 p_x = p_y->m_p_right; in remove_node()
163 p_z->m_p_parent->m_p_right = p_x; in remove_node()
170 if (p_y != p_z->m_p_right) in remove_node()
176 p_y->m_p_right = p_z->m_p_right; in remove_node()
177 p_z->m_p_right->m_p_parent = p_y; in remove_node()
187 p_z->m_p_parent->m_p_right = p_y; in remove_node()
212 node_pointer p_w = p_new_x_parent->m_p_right; in remove_fixup()
[all …]
Dsplit_join_fn_imps.hpp115 p_x->m_p_parent->m_p_right = p_x; in join_imp()
124 p_x->m_p_right = p_x_r; in join_imp()
175 p_l = p_l->m_p_right; in find_join_pos_right()
181 p_l = p_l->m_p_right; in find_join_pos_right()
287 node_pointer p_r = p_nd->m_p_right; in split_at_node()
303 p_parent->m_p_right = p_l; in split_at_node()
Ddebug_fn_imps.hpp58 const size_type r_height = assert_node_consistent(p_nd->m_p_right); in assert_node_consistent()
62 _GLIBCXX_DEBUG_ASSERT(is_effectively_black(p_nd->m_p_right)); in assert_node_consistent()
Dnode.hpp103 node_pointer m_p_right; member
136 node_pointer m_p_right; member
Dinsert_fn_imps.hpp75 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right; in insert_fixup()
85 if (p_nd == p_nd->m_p_parent->m_p_right) in insert_fixup()
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/
Dsplay_fn_imps.hpp80 p_grandparent->m_p_right == p_parent) in splay()
82 else if (p_parent->m_p_right == p_nd && in splay()
109 p_grandparent->m_p_right == p_parent); in splay_zig_zag_left()
113 node_pointer p_b = p_nd->m_p_right; in splay_zig_zag_left()
116 p_nd->m_p_right = p_parent; in splay_zig_zag_left()
126 p_grandparent->m_p_right = p_c; in splay_zig_zag_left()
144 _GLIBCXX_DEBUG_ASSERT(p_parent->m_p_right == p_nd && in splay_zig_zag_right()
150 node_pointer p_c = p_nd->m_p_right; in splay_zig_zag_right()
155 p_nd->m_p_right = p_grandparent; in splay_zig_zag_right()
158 p_parent->m_p_right = p_b; in splay_zig_zag_right()
[all …]
Dinsert_fn_imps.hpp84 p_nd = p_nd->m_p_right; in insert_leaf_imp()
87 …return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), … in insert_leaf_imp()
95 while (p_nd->m_p_right != NULL) in insert_leaf_imp()
96 p_nd = p_nd->m_p_right; in insert_leaf_imp()
Dnode.hpp95 node_pointer m_p_right; member
123 node_pointer m_p_right; member
Dfind_fn_imps.hpp84 p_nd = p_nd->m_p_right; in find_imp()
103 p_nd = p_nd->m_p_right; in find_imp()
Ddebug_fn_imps.hpp76 assert_special_imp(p_nd->m_p_right); in assert_special_imp()
Derase_fn_imps.hpp124 node_pointer p_r = p_nd->m_p_right; in erase_node()
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
Drotate_fn_imps.hpp52 node_pointer p_y = p_x->m_p_right; in rotate_left()
53 p_x->m_p_right = p_y->m_p_left; in rotate_left()
64 p_x->m_p_parent->m_p_right = p_y; in rotate_left()
82 p_x->m_p_left = p_y->m_p_right; in rotate_right()
84 if (p_y->m_p_right != NULL) in rotate_right()
85 p_y->m_p_right->m_p_parent = p_x; in rotate_right()
90 else if (p_x == p_x->m_p_parent->m_p_right) in rotate_right()
91 p_x->m_p_parent->m_p_right = p_y; in rotate_right()
95 p_y->m_p_right = p_x; in rotate_right()
116 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_left == p_parent || p_nd->m_p_right == p_parent); in rotate_parent()
[all …]
Dr_erase_fn_imps.hpp66 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head; in update_min_max_for_erased_node()
76 else if (m_p_head->m_p_right == p_z) in update_min_max_for_erased_node()
80 m_p_head->m_p_right = it.m_p_nd; in update_min_max_for_erased_node()
105 clear_imp(p_nd->m_p_right); in clear_imp()
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/bin_search_tree_/
Dinsert_fn_imps.hpp72 p_nd = p_nd->m_p_right; in insert_leaf()
76 insert_leaf_new(r_value, m_p_head->m_p_right, false), in insert_leaf()
100 while (p_nd->m_p_right != NULL) in insert_leaf()
101 p_nd = p_nd->m_p_right; in insert_leaf()
130 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_right == NULL); in insert_leaf_new()
135 p_nd->m_p_right = p_new_nd; in insert_leaf_new()
137 if (m_p_head->m_p_right == p_nd) in insert_leaf_new()
138 m_p_head->m_p_right = p_new_nd; in insert_leaf_new()
143 p_new_nd->m_p_left = p_new_nd->m_p_right = NULL; in insert_leaf_new()
163 m_p_head->m_p_left = m_p_head->m_p_right = in insert_imp_empty()
[all …]
Drotate_fn_imps.hpp52 node_pointer p_y = p_x->m_p_right; in rotate_left()
54 p_x->m_p_right = p_y->m_p_left; in rotate_left()
66 p_x->m_p_parent->m_p_right = p_y; in rotate_left()
85 p_x->m_p_left = p_y->m_p_right; in rotate_right()
87 if (p_y->m_p_right != NULL) in rotate_right()
88 p_y->m_p_right->m_p_parent = p_x; in rotate_right()
94 else if (p_x == p_x->m_p_parent->m_p_right) in rotate_right()
95 p_x->m_p_parent->m_p_right = p_y; in rotate_right()
99 p_y->m_p_right = p_x; in rotate_right()
123 p_nd->m_p_right == p_parent); in rotate_parent()
Dconstructors_destructor_fn_imps.hpp153 m_p_head->m_p_right = m_p_head; in initialize()
176 p_ret->m_p_left = p_ret->m_p_right = NULL; in recursive_copy_node()
181 p_ret->m_p_right = recursive_copy_node(p_nd->m_p_right); in recursive_copy_node()
192 if (p_ret->m_p_right != NULL) in recursive_copy_node()
193 p_ret->m_p_right->m_p_parent = p_ret; in recursive_copy_node()
206 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head; in initialize_min_max()
219 while (p_max->m_p_right != NULL) in initialize_min_max()
220 p_max = p_max->m_p_right; in initialize_min_max()
221 m_p_head->m_p_right = p_max; in initialize_min_max()
Ddebug_fn_imps.hpp77 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_right == m_p_head); in structure_only_assert_valid()
83 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_right != m_p_head); in structure_only_assert_valid()
119 r_range = assert_node_consistent_(p_nd->m_p_right); in assert_node_consistent_()
145 if (p_nd->m_p_right == NULL) in assert_node_consistent_with_right()
147 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_right->m_p_parent == p_nd); in assert_node_consistent_with_right()
148 _GLIBCXX_DEBUG_ASSERT(!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_p_right->m_value), in assert_node_consistent_with_right()
194 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_right == m_p_head); in assert_max_imp()
198 if (p_nd->m_p_right == NULL) in assert_max_imp()
200 _GLIBCXX_DEBUG_ASSERT(p_nd == m_p_head->m_p_right); in assert_max_imp()
204 assert_max_imp(p_nd->m_p_right); in assert_max_imp()
[all …]
Dfind_fn_imps.hpp59 p_nd = p_nd->m_p_right; in lower_bound()
82 p_nd = p_nd->m_p_right; in lower_bound()
110 p_nd = p_nd->m_p_right; in upper_bound()
132 p_nd = p_nd->m_p_right; in upper_bound()
155 p_nd = p_nd->m_p_right; in find()
181 p_nd = p_nd->m_p_right; in find()
Dpoint_iterators.hpp234 if (m_p_nd->m_p_right != NULL) in inc()
236 m_p_nd = m_p_nd->m_p_right; in inc()
243 while (m_p_nd == p_y->m_p_right) in inc()
249 if (m_p_nd->m_p_right != p_y) in inc()
262 m_p_nd = m_p_nd->m_p_right; in dec()
269 while (p_y->m_p_right != NULL) in dec()
270 p_y = p_y->m_p_right; in dec()
Derase_fn_imps.hpp69 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head; in update_min_max_for_erased_node()
82 else if (m_p_head->m_p_right == p_z) in update_min_max_for_erased_node()
88 m_p_head->m_p_right = it.m_p_nd; in update_min_max_for_erased_node()
120 clear_imp(p_nd->m_p_right); in clear_imp()
Dr_erase_fn_imps.hpp69 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head; in update_min_max_for_erased_node()
82 else if (m_p_head->m_p_right == p_z) in update_min_max_for_erased_node()
88 m_p_head->m_p_right = it.m_p_nd; in update_min_max_for_erased_node()
120 clear_imp(p_nd->m_p_right); in clear_imp()
Dsplit_join_fn_imps.hpp63 …const bool greater = Cmp_Fn::operator()(PB_DS_V2F(m_p_head->m_p_right->m_value), PB_DS_V2F(other.m… in join_prep()
65 …const bool lesser = Cmp_Fn::operator()(PB_DS_V2F(other.m_p_head->m_p_right->m_value), PB_DS_V2F(m_… in join_prep()
111 if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_right->m_value))) in split_prep()
150 return 1 + recursive_count(p->m_p_left) + recursive_count(p->m_p_right); in recursive_count()
Diterators_fn_imps.hpp84 return (const_reverse_iterator(m_p_head->m_p_right)); in rbegin()
92 return (reverse_iterator(m_p_head->m_p_right)); in rbegin()
Dnode_iterators.hpp142 return (PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC(m_p_nd->m_p_right)); in get_r_child()
230 PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC::m_p_nd->m_p_right)); in get_r_child()