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

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

Completed in 148 milliseconds