Searched refs:p_ret (Results 1 - 7 of 7) sorted by relevance

/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
H A Dconstructors_destructor_fn_imps.hpp117 node_pointer p_ret = s_node_allocator.allocate(1);
121 new (p_ret) node(*p_nd);
125 s_node_allocator.deallocate(p_ret, 1);
129 p_ret->m_p_l_child = p_ret->m_p_next_sibling =
130 p_ret->m_p_prev_or_parent = 0;
134 p_ret->m_p_l_child = recursive_copy_node(p_nd->m_p_l_child);
135 p_ret->m_p_next_sibling = recursive_copy_node(p_nd->m_p_next_sibling);
139 clear_imp(p_ret);
143 if (p_ret
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dconstructors_destructor_fn_imps.hpp159 node_pointer p_ret = s_node_allocator.allocate(1);
162 new (p_ret) node(*p_nd);
166 s_node_allocator.deallocate(p_ret, 1);
170 p_ret->m_p_left = p_ret->m_p_right = 0;
174 p_ret->m_p_left = recursive_copy_node(p_nd->m_p_left);
175 p_ret->m_p_right = recursive_copy_node(p_nd->m_p_right);
179 clear_imp(p_ret);
183 if (p_ret->m_p_left != 0)
184 p_ret
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dinsert_join_fn_imps.hpp213 node_pointer p_ret = rec_join(static_cast<leaf_pointer>(p_l), local
215 apply_update(p_ret, (node_update*)this);
216 return p_ret;
220 node_pointer p_ret = rec_join(static_cast<leaf_pointer>(p_l), local
223 apply_update(p_ret, (node_update*)this);
224 return p_ret;
230 node_pointer p_ret = rec_join(static_cast<inode_pointer>(p_l), local
233 apply_update(p_ret, (node_update*)this);
234 return p_ret;
238 node_pointer p_ret local
271 node_pointer p_ret = rec_join(p_r, p_l, checked_ind, r_bag); local
291 node_pointer p_ret = insert_branch(p_l, p_r, r_bag); local
373 node_pointer p_ret = insert_branch(p_l, p_r, r_bag); local
[all...]
H A Dconstructors_destructor_fn_imps.hpp186 inode_pointer p_ret; local
195 p_ret = s_inode_allocator.allocate(1);
204 new (p_ret) inode(p_icp->get_e_ind(), pref_begin(a_p_children[0]));
209 p_ret->add_child(a_p_children[child_i], pref_begin(a_p_children[child_i]),
212 apply_update(p_ret, (node_update*)this);
213 return p_ret;
H A Dsplit_fn_imps.hpp185 node_pointer p_ret = *p_ind->begin(); local
188 apply_update(p_ret, (node_update*)this);
189 return p_ret;
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/
H A Derase_fn_imps.hpp135 node_pointer p_ret = p_nd->m_p_l_child; local
136 if (p_ret == 0)
138 while (p_ret->m_p_next_sibling != 0)
139 p_ret = forward_join(p_ret, p_ret->m_p_next_sibling);
140 while (p_ret->m_p_prev_or_parent != p_nd)
141 p_ret = back_join(p_ret->m_p_prev_or_parent, p_ret);
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/
H A Dsplit_join_fn_imps.hpp138 node_pointer p_ret = 0; local
146 p_ret = p_cur = p_lhs;
158 p_ret = p_cur = p_rhs;
172 p_ret = p_cur = p_lhs;
193 if (p_ret != 0)
194 p_ret->m_p_prev_or_parent = 0;
196 return p_ret;

Completed in 101 milliseconds