Home
last modified time | relevance | path

Searched refs:p_z (Results 1 – 5 of 5) sorted by relevance

/NextBSD/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/
Derase_fn_imps.hpp128 remove_node(node_pointer p_z) in remove_node() argument
130 update_min_max_for_erased_node(p_z); in remove_node()
131 node_pointer p_y = p_z; in remove_node()
147 if (p_y == p_z) in remove_node()
153 if (base_type::m_p_head->m_p_parent == p_z) in remove_node()
155 else if (p_z->m_p_parent->m_p_left == p_z) in remove_node()
157 p_y->m_p_left = p_z->m_p_parent; in remove_node()
158 p_z->m_p_parent->m_p_left = p_x; in remove_node()
163 p_z->m_p_parent->m_p_right = p_x; in remove_node()
168 p_z->m_p_left->m_p_parent = p_y; in remove_node()
[all …]
/NextBSD/contrib/libstdc++/include/ext/pb_ds/detail/bin_search_tree_/
Derase_fn_imps.hpp50 actual_erase_node(node_pointer p_z) in actual_erase_node() argument
55 _GLIBCXX_DEBUG_ONLY(erase_existing(PB_DS_V2F(p_z->m_value))); in actual_erase_node()
57 p_z->~node(); in actual_erase_node()
59 s_node_allocator.deallocate(p_z, 1); in actual_erase_node()
65 update_min_max_for_erased_node(node_pointer p_z) in update_min_max_for_erased_node() argument
74 if (m_p_head->m_p_left == p_z) in update_min_max_for_erased_node()
76 iterator it(p_z); 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()
84 iterator it(p_z); in update_min_max_for_erased_node()
Dr_erase_fn_imps.hpp50 actual_erase_node(node_pointer p_z) in actual_erase_node() argument
55 _GLIBCXX_DEBUG_ONLY(erase_existing(PB_DS_V2F(p_z->m_value))); in actual_erase_node()
57 p_z->~node(); in actual_erase_node()
59 s_node_allocator.deallocate(p_z, 1); in actual_erase_node()
65 update_min_max_for_erased_node(node_pointer p_z) in update_min_max_for_erased_node() argument
74 if (m_p_head->m_p_left == p_z) in update_min_max_for_erased_node()
76 iterator it(p_z); 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()
84 iterator it(p_z); in update_min_max_for_erased_node()
/NextBSD/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
Dr_erase_fn_imps.hpp50 actual_erase_node(node_pointer p_z) in actual_erase_node() argument
54 _GLIBCXX_DEBUG_ONLY(erase_existing(PB_DS_V2F(p_z->m_value))); in actual_erase_node()
55 p_z->~node(); in actual_erase_node()
56 s_node_allocator.deallocate(p_z, 1); in actual_erase_node()
62 update_min_max_for_erased_node(node_pointer p_z) in update_min_max_for_erased_node() argument
70 if (m_p_head->m_p_left == p_z) in update_min_max_for_erased_node()
72 iterator it(p_z); 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()
78 iterator it(p_z); in update_min_max_for_erased_node()
/NextBSD/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/
Dinsert_fn_imps.hpp159 node_pointer p_z = p_y->m_p_prev_or_parent; in fix() local
163 p_y = p_z; in fix()