Searched refs:p_y (Results 1 - 9 of 9) sorted by relevance

/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/
H A Dinsert_fn_imps.hpp117 fix(node_pointer p_y) argument
121 if (p_y->m_p_prev_or_parent == NULL)
123 fix_root(p_y);
127 else if (p_y->m_metadata == 1&& p_y->m_p_next_sibling == NULL)
129 if (p_y->m_p_l_child != NULL)
131 fix_sibling_rank_1_unmarked(p_y);
136 fix_sibling_rank_1_marked(p_y);
138 p_y = p_y
173 fix_root(node_pointer p_y) argument
185 fix_sibling_rank_1_unmarked(node_pointer p_y) argument
206 fix_sibling_rank_1_marked(node_pointer p_y) argument
219 fix_sibling_general_unmarked(node_pointer p_y) argument
243 fix_sibling_general_marked(node_pointer p_y) argument
255 fix_child(node_pointer p_y) argument
306 node_pointer p_y = p_nd->m_p_prev_or_parent; local
[all...]
H A Dthin_heap_.hpp221 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_y);
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/bin_search_tree_/
H A Drotate_fn_imps.hpp52 node_pointer p_y = p_x->m_p_right; local
54 p_x->m_p_right = p_y->m_p_left;
56 if (p_y->m_p_left != NULL)
57 p_y->m_p_left->m_p_parent = p_x;
59 p_y->m_p_parent = p_x->m_p_parent;
62 m_p_head->m_p_parent = p_y;
64 p_x->m_p_parent->m_p_left = p_y;
66 p_x->m_p_parent->m_p_right = p_y;
68 p_y->m_p_left = p_x;
69 p_x->m_p_parent = p_y;
83 node_pointer p_y = p_x->m_p_left; local
[all...]
H A Dpoint_iterators.hpp242 Node_Pointer p_y = m_p_nd->m_p_parent; local
243 while (m_p_nd == p_y->m_p_right)
245 m_p_nd = p_y;
246 p_y = p_y->m_p_parent;
249 if (m_p_nd->m_p_right != p_y)
250 m_p_nd = p_y;
268 Node_Pointer p_y = m_p_nd->m_p_left; local
269 while (p_y->m_p_right != NULL)
270 p_y
275 Node_Pointer p_y = m_p_nd->m_p_parent; local
[all...]
H A Dbin_search_tree_.hpp376 rotate_right(node_pointer p_y);
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
H A Drotate_fn_imps.hpp52 node_pointer p_y = p_x->m_p_right; local
53 p_x->m_p_right = p_y->m_p_left;
55 if (p_y->m_p_left != NULL)
56 p_y->m_p_left->m_p_parent = p_x;
58 p_y->m_p_parent = p_x->m_p_parent;
60 m_p_head->m_p_parent = p_y;
62 p_x->m_p_parent->m_p_left = p_y;
64 p_x->m_p_parent->m_p_right = p_y;
66 p_y->m_p_left = p_x;
67 p_x->m_p_parent = p_y;
81 node_pointer p_y = p_x->m_p_left; local
[all...]
H A Dpoint_iterators.hpp252 node_pointer p_y = m_p_nd->m_p_parent; local
253 while (p_y->m_type != pat_trie_head_node_type &&
256 m_p_nd = p_y;
257 p_y = p_y->m_p_parent;
260 if (p_y->m_type == pat_trie_head_node_type)
262 m_p_nd = p_y;
281 node_pointer p_y = m_p_nd->m_p_parent; local
282 while (p_y->m_type != pat_trie_head_node_type &&
285 m_p_nd = p_y;
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/
H A Derase_fn_imps.hpp131 node_pointer p_y = p_z; local
135 if (p_y->m_p_left == NULL)
136 p_x = p_y->m_p_right;
137 else if (p_y->m_p_right == NULL)
138 p_x = p_y->m_p_left;
141 p_y = p_y->m_p_right;
142 while (p_y->m_p_left != NULL)
143 p_y = p_y
[all...]
H A Dinsert_fn_imps.hpp75 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right; local
76 if (p_y != NULL && p_y->m_red)
79 p_y->m_red = false;
97 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_left; local
98 if (p_y != NULL && p_y->m_red)
101 p_y->m_red = false;

Completed in 68 milliseconds