Searched refs:m_p_right (Results 1 - 25 of 46) sorted by relevance

12

/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Drotate_fn_imps.hpp46 node_pointer p_y = p_x->m_p_right;
47 p_x->m_p_right = p_y->m_p_left;
58 p_x->m_p_parent->m_p_right = p_y;
76 p_x->m_p_left = p_y->m_p_right;
78 if (p_y->m_p_right != NULL)
79 p_y->m_p_right->m_p_parent = p_x;
84 else if (p_x == p_x->m_p_parent->m_p_right)
85 p_x->m_p_parent->m_p_right = p_y;
89 p_y->m_p_right = p_x;
110 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_left == p_parent || p_nd->m_p_right
[all...]
H A Dr_erase_fn_imps.hpp60 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
70 else if (m_p_head->m_p_right == p_z)
74 m_p_head->m_p_right = it.m_p_nd;
99 clear_imp(p_nd->m_p_right);
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/
H A Drotate_fn_imps.hpp50 node_pointer p_y = p_x->m_p_right;
52 p_x->m_p_right = p_y->m_p_left;
64 p_x->m_p_parent->m_p_right = p_y;
83 p_x->m_p_left = p_y->m_p_right;
85 if (p_y->m_p_right != NULL)
86 p_y->m_p_right->m_p_parent = p_x;
92 else if (p_x == p_x->m_p_parent->m_p_right)
93 p_x->m_p_parent->m_p_right = p_y;
97 p_y->m_p_right = p_x;
121 p_nd->m_p_right
[all...]
H A Dinsert_fn_imps.hpp70 p_nd = p_nd->m_p_right;
74 insert_leaf_new(r_mapped_value, m_p_head->m_p_right, false),
98 while (p_nd->m_p_right != NULL)
99 p_nd = p_nd->m_p_right;
128 PB_ASSOC_DBG_ASSERT(p_nd->m_p_right == NULL);
133 p_nd->m_p_right = p_new_nd;
135 if (m_p_head->m_p_right == p_nd)
136 m_p_head->m_p_right = p_new_nd;
141 p_new_nd->m_p_left = p_new_nd->m_p_right = NULL;
161 m_p_head->m_p_left = m_p_head->m_p_right
[all...]
H A Derase_fn_imps.hpp67 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
80 else if (m_p_head->m_p_right == p_z)
86 m_p_head->m_p_right = it.m_p_nd;
118 clear_imp(p_nd->m_p_right);
H A Dr_erase_fn_imps.hpp67 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
80 else if (m_p_head->m_p_right == p_z)
86 m_p_head->m_p_right = it.m_p_nd;
118 clear_imp(p_nd->m_p_right);
H A Dconstructors_destructor_fn_imps.hpp176 m_p_head->m_p_right = m_p_head;
202 p_ret->m_p_left = p_ret->m_p_right = NULL;
208 p_ret->m_p_right = recursive_copy_node(p_nd->m_p_right);
220 if (p_ret->m_p_right != NULL)
221 p_ret->m_p_right->m_p_parent = p_ret;
235 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
252 while (p_max->m_p_right != NULL)
253 p_max = p_max->m_p_right;
255 m_p_head->m_p_right
[all...]
H A Ddebug_fn_imps.hpp57 PB_ASSOC_DBG_ASSERT(m_p_head->m_p_right == m_p_head);
67 PB_ASSOC_DBG_ASSERT(m_p_head->m_p_right != m_p_head);
109 if (p_nd->m_p_right == NULL)
112 PB_ASSOC_DBG_ASSERT(p_nd->m_p_right->m_p_parent == p_nd);
115 PB_ASSOC_V2F(p_nd->m_p_right->m_value),
164 PB_ASSOC_DBG_ASSERT(m_p_head->m_p_right == m_p_head);
169 if (p_nd->m_p_right == NULL)
171 PB_ASSOC_DBG_ASSERT(p_nd == m_p_head->m_p_right);
176 assert_max_imp(p_nd->m_p_right);
267 assert_consistent_with_debug_base(p_nd->m_p_right);
[all...]
H A Dfind_fn_imps.hpp61 p_nd = p_nd->m_p_right;
84 p_nd = p_nd->m_p_right;
106 p_nd = p_nd->m_p_right;
128 p_nd = p_nd->m_p_right;
151 p_nd = p_nd->m_p_right;
177 p_nd = p_nd->m_p_right;
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Drotate_fn_imps.hpp46 node_pointer p_y = p_x->m_p_right;
48 p_x->m_p_right = p_y->m_p_left;
60 p_x->m_p_parent->m_p_right = p_y;
79 p_x->m_p_left = p_y->m_p_right;
81 if (p_y->m_p_right != NULL)
82 p_y->m_p_right->m_p_parent = p_x;
88 else if (p_x == p_x->m_p_parent->m_p_right)
89 p_x->m_p_parent->m_p_right = p_y;
93 p_y->m_p_right = p_x;
117 p_nd->m_p_right
[all...]
H A Dinsert_fn_imps.hpp66 p_nd = p_nd->m_p_right;
70 insert_leaf_new(r_value, m_p_head->m_p_right, false),
94 while (p_nd->m_p_right != NULL)
95 p_nd = p_nd->m_p_right;
124 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_right == NULL);
129 p_nd->m_p_right = p_new_nd;
131 if (m_p_head->m_p_right == p_nd)
132 m_p_head->m_p_right = p_new_nd;
137 p_new_nd->m_p_left = p_new_nd->m_p_right = NULL;
157 m_p_head->m_p_left = m_p_head->m_p_right
[all...]
H A Derase_fn_imps.hpp63 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
76 else if (m_p_head->m_p_right == p_z)
82 m_p_head->m_p_right = it.m_p_nd;
114 clear_imp(p_nd->m_p_right);
H A Dr_erase_fn_imps.hpp63 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
76 else if (m_p_head->m_p_right == p_z)
82 m_p_head->m_p_right = it.m_p_nd;
114 clear_imp(p_nd->m_p_right);
H A Dconstructors_destructor_fn_imps.hpp147 m_p_head->m_p_right = m_p_head;
170 p_ret->m_p_left = p_ret->m_p_right = NULL;
175 p_ret->m_p_right = recursive_copy_node(p_nd->m_p_right);
186 if (p_ret->m_p_right != NULL)
187 p_ret->m_p_right->m_p_parent = p_ret;
200 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
213 while (p_max->m_p_right != NULL)
214 p_max = p_max->m_p_right;
215 m_p_head->m_p_right
[all...]
H A Dfind_fn_imps.hpp53 p_nd = p_nd->m_p_right;
76 p_nd = p_nd->m_p_right;
104 p_nd = p_nd->m_p_right;
126 p_nd = p_nd->m_p_right;
149 p_nd = p_nd->m_p_right;
175 p_nd = p_nd->m_p_right;
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/
H A Derase_fn_imps.hpp130 p_x = p_y->m_p_right;
131 else if (p_y->m_p_right == NULL)
135 p_y = p_y->m_p_right;
138 p_x = p_y->m_p_right;
157 p_z->m_p_parent->m_p_right = p_x;
164 if (p_y != p_z->m_p_right)
170 p_y->m_p_right = p_z->m_p_right;
171 p_z->m_p_right->m_p_parent = p_y;
181 p_z->m_p_parent->m_p_right
[all...]
H A Ddebug_fn_imps.hpp52 const size_type r_height = assert_node_consistent(p_nd->m_p_right);
56 _GLIBCXX_DEBUG_ASSERT(is_effectively_black(p_nd->m_p_right));
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/
H A Derase_fn_imps.hpp208 p_x = p_y->m_p_right;
209 else if (p_y->m_p_right == NULL)
213 p_y = p_y->m_p_right;
218 p_x = p_y->m_p_right;
240 p_z->m_p_parent->m_p_right = p_x;
249 if (p_y != p_z->m_p_right)
258 p_y->m_p_right = p_z->m_p_right;
260 p_z->m_p_right->m_p_parent = p_y;
270 p_z->m_p_parent->m_p_right
[all...]
H A Ddebug_fn_imps.hpp56 const size_type r_height = assert_node_consistent(p_nd->m_p_right);
62 PB_ASSOC_DBG_ASSERT(is_effectively_black(p_nd->m_p_right));
H A Dnode.hpp74 node_pointer m_p_right; member in struct:pb_assoc::detail::rb_tree_node_
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/
H A Dsplay_fn_imps.hpp74 p_grandparent->m_p_right == p_parent)
76 else if (p_parent->m_p_right == p_nd &&
103 p_grandparent->m_p_right == p_parent);
107 node_pointer p_b = p_nd->m_p_right;
110 p_nd->m_p_right = p_parent;
120 p_grandparent->m_p_right = p_c;
138 _GLIBCXX_DEBUG_ASSERT(p_parent->m_p_right == p_nd &&
144 node_pointer p_c = p_nd->m_p_right;
149 p_nd->m_p_right = p_grandparent;
152 p_parent->m_p_right
[all...]
H A Dinsert_fn_imps.hpp78 p_nd = p_nd->m_p_right;
81 return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), true);
89 while (p_nd->m_p_right != NULL)
90 p_nd = p_nd->m_p_right;
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/
H A Dsplay_fn_imps.hpp75 p_grandparent->m_p_right == p_parent)
77 else if (p_parent->m_p_right == p_nd&&
105 p_grandparent->m_p_right == p_parent);
109 node_pointer p_b = p_nd->m_p_right;
112 p_nd->m_p_right = p_parent;
122 p_grandparent->m_p_right = p_c;
139 PB_ASSOC_DBG_ASSERT(p_parent->m_p_right == p_nd&&
145 node_pointer p_c = p_nd->m_p_right;
150 p_nd->m_p_right = p_grandparent;
153 p_parent->m_p_right
[all...]
H A Ddebug_fn_imps.hpp69 assert_special_imp(p_nd->m_p_right);
H A Dnode.hpp80 node_pointer m_p_right; member in struct:pb_assoc::detail::splay_tree_node_

Completed in 139 milliseconds

12