3 // Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the terms
7 // of the GNU General Public License as published by the Free Software
8 // Foundation; either version 3, or (at your option) any later
11 // This library is distributed in the hope that it will be useful, but
12 // WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // General Public License for more details.
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
27 // Permission to use, copy, modify, sell, and distribute this software
28 // is hereby granted without fee, provided that the above copyright
29 // notice appears in all copies, and that both that copyright notice
30 // and this permission notice appear in supporting documentation. None
31 // of the above authors, nor IBM Haifa Research Laboratories, make any
32 // representation about the suitability of this software for any
33 // purpose. It is provided "as is" without express or implied
37 * @file erase_fn_imps.hpp
38 * Contains an implementation class for splay_tree_.
44 erase(const_key_reference r_key
)
46 point_iterator it
= find(r_key
);
47 if (it
== base_type::end())
54 inline typename
PB_DS_CLASS_C_DEC::iterator
58 _GLIBCXX_DEBUG_ONLY(assert_valid());
59 if (it
== base_type::end())
63 erase_node(it
.m_p_nd
);
64 _GLIBCXX_DEBUG_ONLY(assert_valid());
69 inline typename
PB_DS_CLASS_C_DEC::reverse_iterator
71 erase(reverse_iterator it
)
73 _GLIBCXX_DEBUG_ONLY(assert_valid());
74 if (it
.m_p_nd
== base_type::m_p_head
)
76 reverse_iterator ret_it
= it
;
78 erase_node(it
.m_p_nd
);
79 _GLIBCXX_DEBUG_ONLY(assert_valid());
84 template<typename Pred
>
85 inline typename
PB_DS_CLASS_C_DEC::size_type
89 _GLIBCXX_DEBUG_ONLY(assert_valid();)
90 size_type num_ersd
= 0;
91 iterator it
= base_type::begin();
92 while (it
!= base_type::end())
102 _GLIBCXX_DEBUG_ONLY(assert_valid();)
109 erase_node(node_pointer p_nd
)
111 _GLIBCXX_DEBUG_ASSERT(p_nd
!= 0);
114 _GLIBCXX_DEBUG_ONLY(assert_valid();)
115 _GLIBCXX_DEBUG_ASSERT(p_nd
== this->m_p_head
->m_p_parent
);
117 node_pointer p_l
= p_nd
->m_p_left
;
118 node_pointer p_r
= p_nd
->m_p_right
;
120 base_type::update_min_max_for_erased_node(p_nd
);
121 base_type::actual_erase_node(p_nd
);
124 base_type::m_p_head
->m_p_parent
= p_l
;
126 p_l
->m_p_parent
= base_type::m_p_head
;
127 _GLIBCXX_DEBUG_ONLY(assert_valid();)
131 node_pointer p_target_r
= leftmost(p_r
);
132 _GLIBCXX_DEBUG_ASSERT(p_target_r
!= 0);
133 p_r
->m_p_parent
= base_type::m_p_head
;
134 base_type::m_p_head
->m_p_parent
= p_r
;
137 _GLIBCXX_DEBUG_ONLY(p_target_r
->m_p_left
= 0);
138 _GLIBCXX_DEBUG_ASSERT(p_target_r
->m_p_parent
== this->m_p_head
);
139 _GLIBCXX_DEBUG_ASSERT(this->m_p_head
->m_p_parent
== p_target_r
);
141 p_target_r
->m_p_left
= p_l
;
143 p_l
->m_p_parent
= p_target_r
;
144 _GLIBCXX_DEBUG_ONLY(assert_valid();)
145 apply_update(p_target_r
, (node_update
* )this);
149 inline typename
PB_DS_CLASS_C_DEC::node_pointer
151 leftmost(node_pointer p_nd
)
153 _GLIBCXX_DEBUG_ASSERT(p_nd
!= 0);
154 while (p_nd
->m_p_left
!= 0)
155 p_nd
= p_nd
->m_p_left
;