3 // Copyright (C) 2005, 2006 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 2, 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 // You should have received a copy of the GNU General Public License
17 // along with this library; see the file COPYING. If not, write to
18 // the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
19 // MA 02111-1307, USA.
21 // As a special exception, you may use this file as part of a free
22 // software library without restriction. Specifically, if other files
23 // instantiate templates or use macros or inline functions from this
24 // file, or you compile this file and link it with other files to
25 // produce an executable, this file does not by itself cause the
26 // resulting executable to be covered by the GNU General Public
27 // License. This exception does not however invalidate any other
28 // reasons why the executable file might be covered by the GNU General
31 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
33 // Permission to use, copy, modify, sell, and distribute this software
34 // is hereby granted without fee, provided that the above copyright
35 // notice appears in all copies, and that both that copyright notice
36 // and this permission notice appear in supporting documentation. None
37 // of the above authors, nor IBM Haifa Research Laboratories, make any
38 // representation about the suitability of this software for any
39 // purpose. It is provided "as is" without express or implied
43 * @file erase_fn_imps.hpp
44 * Contains an implementation class for splay_tree_.
50 erase(const_key_reference r_key)
52 point_iterator it = find(r_key);
53 if (it == base_type::end())
60 inline typename PB_DS_CLASS_C_DEC::iterator
64 _GLIBCXX_DEBUG_ONLY(assert_valid());
65 if (it == base_type::end())
69 erase_node(it.m_p_nd);
70 _GLIBCXX_DEBUG_ONLY(assert_valid());
75 inline typename PB_DS_CLASS_C_DEC::reverse_iterator
77 erase(reverse_iterator it)
79 _GLIBCXX_DEBUG_ONLY(assert_valid());
80 if (it.m_p_nd == base_type::m_p_head)
82 reverse_iterator ret_it = it;
84 erase_node(it.m_p_nd);
85 _GLIBCXX_DEBUG_ONLY(assert_valid());
90 template<typename Pred>
91 inline typename PB_DS_CLASS_C_DEC::size_type
95 _GLIBCXX_DEBUG_ONLY(assert_valid();)
96 size_type num_ersd = 0;
97 iterator it = base_type::begin();
98 while (it != base_type::end())
108 _GLIBCXX_DEBUG_ONLY(assert_valid();)
115 erase_node(node_pointer p_nd)
117 _GLIBCXX_DEBUG_ASSERT(p_nd != NULL);
120 _GLIBCXX_DEBUG_ONLY(assert_valid();)
121 _GLIBCXX_DEBUG_ASSERT(p_nd == this->m_p_head->m_p_parent);
123 node_pointer p_l = p_nd->m_p_left;
124 node_pointer p_r = p_nd->m_p_right;
126 base_type::update_min_max_for_erased_node(p_nd);
127 base_type::actual_erase_node(p_nd);
130 base_type::m_p_head->m_p_parent = p_l;
132 p_l->m_p_parent = base_type::m_p_head;
133 _GLIBCXX_DEBUG_ONLY(assert_valid();)
137 node_pointer p_target_r = leftmost(p_r);
138 _GLIBCXX_DEBUG_ASSERT(p_target_r != NULL);
139 p_r->m_p_parent = base_type::m_p_head;
140 base_type::m_p_head->m_p_parent = p_r;
143 _GLIBCXX_DEBUG_ONLY(p_target_r->m_p_left = NULL);
144 _GLIBCXX_DEBUG_ASSERT(p_target_r->m_p_parent == this->m_p_head);
145 _GLIBCXX_DEBUG_ASSERT(this->m_p_head->m_p_parent == p_target_r);
147 p_target_r->m_p_left = p_l;
149 p_l->m_p_parent = p_target_r;
150 _GLIBCXX_DEBUG_ONLY(assert_valid();)
151 apply_update(p_target_r, (node_update* )this);
155 inline typename PB_DS_CLASS_C_DEC::node_pointer
157 leftmost(node_pointer p_nd)
159 _GLIBCXX_DEBUG_ASSERT(p_nd != NULL);
160 while (p_nd->m_p_left != NULL)
161 p_nd = p_nd->m_p_left;