Searched refs:p_z (Results 1 – 5 of 5) sorted by relevance
124 remove_node(node_pointer p_z) in remove_node() argument126 this->update_min_max_for_erased_node(p_z); in remove_node()127 node_pointer p_y = p_z; in remove_node()143 if (p_y == p_z) in remove_node()149 if (base_type::m_p_head->m_p_parent == p_z) in remove_node()151 else if (p_z->m_p_parent->m_p_left == p_z) in remove_node()153 p_y->m_p_left = p_z->m_p_parent; in remove_node()154 p_z->m_p_parent->m_p_left = p_x; in remove_node()159 p_z->m_p_parent->m_p_right = p_x; in remove_node()164 p_z->m_p_left->m_p_parent = p_y; in remove_node()[all …]
46 actual_erase_node(node_pointer p_z) in actual_erase_node() argument50 _GLIBCXX_DEBUG_ONLY(erase_existing(PB_DS_V2F(p_z->m_value));) in actual_erase_node()51 p_z->~node(); in actual_erase_node()52 s_node_allocator.deallocate(p_z, 1); in actual_erase_node()58 update_min_max_for_erased_node(node_pointer p_z) in update_min_max_for_erased_node() argument66 if (m_p_head->m_p_left == p_z) in update_min_max_for_erased_node()68 iterator it(p_z); in update_min_max_for_erased_node()72 else if (m_p_head->m_p_right == p_z) in update_min_max_for_erased_node()74 iterator it(p_z); in update_min_max_for_erased_node()
46 actual_erase_node(node_pointer p_z) in actual_erase_node() argument50 _GLIBCXX_DEBUG_ONLY(debug_base::erase_existing(PB_DS_V2F(p_z->m_value));) in actual_erase_node()51 p_z->~node(); in actual_erase_node()52 s_node_allocator.deallocate(p_z, 1); in actual_erase_node()58 update_min_max_for_erased_node(node_pointer p_z) in update_min_max_for_erased_node() argument66 if (m_p_head->m_p_left == p_z) in update_min_max_for_erased_node()68 iterator it(p_z); in update_min_max_for_erased_node()72 else if (m_p_head->m_p_right == p_z) in update_min_max_for_erased_node()74 iterator it(p_z); in update_min_max_for_erased_node()
46 actual_erase_node(node_pointer p_z) in actual_erase_node() argument50 _GLIBCXX_DEBUG_ONLY(debug_base::erase_existing(PB_DS_V2F(p_z->m_value))); in actual_erase_node()51 p_z->~node(); in actual_erase_node()52 s_node_allocator.deallocate(p_z, 1); in actual_erase_node()58 update_min_max_for_erased_node(node_pointer p_z) in update_min_max_for_erased_node() argument66 if (m_p_head->m_p_left == p_z) in update_min_max_for_erased_node()68 iterator it(p_z); in update_min_max_for_erased_node()72 else if (m_p_head->m_p_right == p_z) in update_min_max_for_erased_node()74 iterator it(p_z); in update_min_max_for_erased_node()
131 node_pointer p_z = p_y->m_p_prev_or_parent; in fix() local133 p_y = p_z; in fix()