libstdc++
splay_tree_/erase_fn_imps.hpp
Go to the documentation of this file.
1 // -*- C++ -*-
2 
3 // Copyright (C) 2005-2020 Free Software Foundation, Inc.
4 //
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
9 // version.
10 
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.
15 
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.
19 
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/>.
24 
25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
26 
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
34 // warranty.
35 
36 /**
37  * @file splay_tree_/erase_fn_imps.hpp
38  * Contains an implementation class for splay_tree_.
39  */
40 
41 #ifdef PB_DS_CLASS_C_DEC
42 
43 PB_DS_CLASS_T_DEC
44 inline bool
45 PB_DS_CLASS_C_DEC::
46 erase(key_const_reference r_key)
47 {
48  point_iterator it = find(r_key);
49  if (it == base_type::end())
50  return false;
51  erase(it);
52  return true;
53 }
54 
55 PB_DS_CLASS_T_DEC
56 inline typename PB_DS_CLASS_C_DEC::iterator
57 PB_DS_CLASS_C_DEC::
58 erase(iterator it)
59 {
60  PB_DS_ASSERT_VALID((*this))
61  if (it == base_type::end())
62  return it;
63  iterator ret_it = it;
64  ++ret_it;
65  erase_node(it.m_p_nd);
66  PB_DS_ASSERT_VALID((*this))
67  return ret_it;
68 }
69 
70 PB_DS_CLASS_T_DEC
71 inline typename PB_DS_CLASS_C_DEC::reverse_iterator
72 PB_DS_CLASS_C_DEC::
73 erase(reverse_iterator it)
74 {
75  PB_DS_ASSERT_VALID((*this))
76  if (it.m_p_nd == base_type::m_p_head)
77  return (it);
78  reverse_iterator ret_it = it;
79  ++ret_it;
80  erase_node(it.m_p_nd);
81  PB_DS_ASSERT_VALID((*this))
82  return ret_it;
83 }
84 
85 PB_DS_CLASS_T_DEC
86 template<typename Pred>
87 inline typename PB_DS_CLASS_C_DEC::size_type
88 PB_DS_CLASS_C_DEC::
89 erase_if(Pred pred)
90 {
91  PB_DS_ASSERT_VALID((*this))
92  size_type num_ersd = 0;
93  iterator it = base_type::begin();
94  while (it != base_type::end())
95  {
96  if (pred(*it))
97  {
98  ++num_ersd;
99  it = erase(it);
100  }
101  else
102  ++it;
103  }
104  PB_DS_ASSERT_VALID((*this))
105  return num_ersd;
106 }
107 
108 PB_DS_CLASS_T_DEC
109 void
110 PB_DS_CLASS_C_DEC::
111 erase_node(node_pointer p_nd)
112 {
113  _GLIBCXX_DEBUG_ASSERT(p_nd != 0);
114  splay(p_nd);
115 
116  PB_DS_ASSERT_VALID((*this))
117  _GLIBCXX_DEBUG_ASSERT(p_nd == this->m_p_head->m_p_parent);
118 
119  node_pointer p_l = p_nd->m_p_left;
120  node_pointer p_r = p_nd->m_p_right;
121 
122  base_type::update_min_max_for_erased_node(p_nd);
123  base_type::actual_erase_node(p_nd);
124  if (p_r == 0)
125  {
126  base_type::m_p_head->m_p_parent = p_l;
127  if (p_l != 0)
128  p_l->m_p_parent = base_type::m_p_head;
129  PB_DS_ASSERT_VALID((*this))
130  return;
131  }
132 
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;
137  splay(p_target_r);
138 
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);
142 
143  p_target_r->m_p_left = p_l;
144  if (p_l != 0)
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);
148 }
149 
150 PB_DS_CLASS_T_DEC
151 inline typename PB_DS_CLASS_C_DEC::node_pointer
152 PB_DS_CLASS_C_DEC::
153 leftmost(node_pointer p_nd)
154 {
155  _GLIBCXX_DEBUG_ASSERT(p_nd != 0);
156  while (p_nd->m_p_left != 0)
157  p_nd = p_nd->m_p_left;
158  return p_nd;
159 }
160 #endif
_Tp * end(valarray< _Tp > &__va) noexcept
Return an iterator pointing to one past the last element of the valarray.
Definition: valarray:1234
constexpr const _Tp * begin(initializer_list< _Tp > __ils) noexcept
Return an iterator pointing to the first element of the initializer_list.
constexpr const _Tp * end(initializer_list< _Tp > __ils) noexcept
Return an iterator pointing to one past the last element of the initializer_list.