41#ifdef PB_DS_CLASS_C_DEC
46erase(key_const_reference r_key)
48 point_iterator it = find(r_key);
49 if (it == base_type::end())
56inline typename PB_DS_CLASS_C_DEC::iterator
60 PB_DS_ASSERT_VALID((*
this))
61 if (it == base_type::end())
65 erase_node(it.m_p_nd);
66 PB_DS_ASSERT_VALID((*this))
71inline typename PB_DS_CLASS_C_DEC::reverse_iterator
73erase(reverse_iterator it)
75 PB_DS_ASSERT_VALID((*
this))
76 if (it.m_p_nd == base_type::m_p_head)
78 reverse_iterator ret_it = it;
80 erase_node(it.m_p_nd);
81 PB_DS_ASSERT_VALID((*this))
86template<typename Pred>
87inline typename PB_DS_CLASS_C_DEC::size_type
91 PB_DS_ASSERT_VALID((*
this))
92 size_type num_ersd = 0;
93 iterator it = base_type::begin();
94 while (it != base_type::end())
104 PB_DS_ASSERT_VALID((*
this))
111erase_node(node_pointer p_nd)
113 _GLIBCXX_DEBUG_ASSERT(p_nd != 0);
116 PB_DS_ASSERT_VALID((*
this))
117 _GLIBCXX_DEBUG_ASSERT(p_nd == this->m_p_head->m_p_parent);
119 node_pointer p_l = p_nd->m_p_left;
120 node_pointer p_r = p_nd->m_p_right;
122 base_type::update_min_max_for_erased_node(p_nd);
123 base_type::actual_erase_node(p_nd);
126 base_type::m_p_head->m_p_parent = p_l;
128 p_l->m_p_parent = base_type::m_p_head;
129 PB_DS_ASSERT_VALID((*
this))
133 node_pointer p_target_r = leftmost(p_r);
134 _GLIBCXX_DEBUG_ASSERT(p_target_r != 0);
135 p_r->m_p_parent = base_type::m_p_head;
136 base_type::m_p_head->m_p_parent = p_r;
139 _GLIBCXX_DEBUG_ONLY(p_target_r->m_p_left = 0);
140 _GLIBCXX_DEBUG_ASSERT(p_target_r->m_p_parent == this->m_p_head);
141 _GLIBCXX_DEBUG_ASSERT(this->m_p_head->m_p_parent == p_target_r);
143 p_target_r->m_p_left = p_l;
145 p_l->m_p_parent = p_target_r;
146 PB_DS_ASSERT_VALID((*this))
147 this->apply_update(p_target_r, (node_update*)this);
151inline typename PB_DS_CLASS_C_DEC::node_pointer
153leftmost(node_pointer p_nd)
155 _GLIBCXX_DEBUG_ASSERT(p_nd != 0);
156 while (p_nd->m_p_left != 0)
157 p_nd = p_nd->m_p_left;