libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/erase_fn_imps.hpp

   1 // -*- C++ -*-
   2
   3 // Copyright (C) 2005, 2006 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 2, 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 // 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.
  20
  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
  29 // Public License.
  30
  31 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
  32
  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
  40 // warranty.
  41
  42 /**
  43  * @file erase_fn_imps.hpp
  44  * Contains an implementation class for splay_tree_.
  45  */
  46
  47 PB_DS_CLASS_T_DEC
  48 inline bool
  49 PB_DS_CLASS_C_DEC::
  50 erase(const_key_reference r_key)
  51 {
  52   point_iterator it = find(r_key);
  53
  54   if (it == PB_DS_BASE_C_DEC::end())
  55     return (false);
  56
  57   erase(it);
  58
  59   return (true);
  60 }
  61
  62 PB_DS_CLASS_T_DEC
  63 inline typename PB_DS_CLASS_C_DEC::iterator
  64 PB_DS_CLASS_C_DEC::
  65 erase(iterator it)
  66 {
  67   PB_DS_DBG_ONLY(assert_valid());
  68
  69   if (it == PB_DS_BASE_C_DEC::end())
  70     return (it);
  71
  72   iterator ret_it = it;
  73
  74   ++ret_it;
  75
  76   erase_node(it.m_p_nd);
  77
  78   PB_DS_DBG_ONLY(assert_valid());
  79
  80   return (ret_it);
  81 }
  82
  83 PB_DS_CLASS_T_DEC
  84 inline typename PB_DS_CLASS_C_DEC::reverse_iterator
  85 PB_DS_CLASS_C_DEC::
  86 erase(reverse_iterator it)
  87 {
  88   PB_DS_DBG_ONLY(assert_valid());
  89
  90   if (it.m_p_nd == PB_DS_BASE_C_DEC::m_p_head)
  91     return (it);
  92
  93   reverse_iterator ret_it = it;
  94
  95   ++ret_it;
  96
  97   erase_node(it.m_p_nd);
  98
  99   PB_DS_DBG_ONLY(assert_valid());
 100
 101   return (ret_it);
 102 }
 103
 104 PB_DS_CLASS_T_DEC
 105 template<typename Pred>
 106 inline typename PB_DS_CLASS_C_DEC::size_type
 107 PB_DS_CLASS_C_DEC::
 108 erase_if(Pred pred)
 109 {
 110   PB_DS_DBG_ONLY(assert_valid();)
 111
 112     size_type num_ersd = 0;
 113
 114   iterator it = PB_DS_BASE_C_DEC::begin();
 115
 116   while (it != PB_DS_BASE_C_DEC::end())
 117     {
 118       if (pred(*it))
 119         {
 120           ++num_ersd;
 121
 122           it = erase(it);
 123         }
 124       else
 125         ++it;
 126     }
 127
 128   PB_DS_DBG_ONLY(assert_valid();)
 129
 130     return (num_ersd);
 131 }
 132
 133 PB_DS_CLASS_T_DEC
 134 void
 135 PB_DS_CLASS_C_DEC::
 136 erase_node(node_pointer p_nd)
 137 {
 138   PB_DS_DBG_ASSERT(p_nd != NULL);
 139
 140   splay(p_nd);
 141
 142   PB_DS_DBG_ONLY(assert_valid();)
 143     PB_DS_DBG_ASSERT(p_nd == this->m_p_head->m_p_parent);
 144
 145   node_pointer p_l = p_nd->m_p_left;
 146   node_pointer p_r = p_nd->m_p_right;
 147
 148   PB_DS_BASE_C_DEC::update_min_max_for_erased_node(p_nd);
 149
 150   PB_DS_BASE_C_DEC::actual_erase_node(p_nd);
 151
 152   if (p_r == NULL)
 153     {
 154       PB_DS_BASE_C_DEC::m_p_head->m_p_parent = p_l;
 155
 156       if (p_l != NULL)
 157         p_l->m_p_parent = PB_DS_BASE_C_DEC::m_p_head;
 158
 159       PB_DS_DBG_ONLY(assert_valid();)
 160
 161         return;
 162     }
 163
 164   node_pointer p_target_r = leftmost(p_r);
 165
 166   PB_DS_DBG_ASSERT(p_target_r != NULL);
 167
 168   p_r->m_p_parent = PB_DS_BASE_C_DEC::m_p_head;
 169
 170   PB_DS_BASE_C_DEC::m_p_head->m_p_parent = p_r;
 171
 172   splay(p_target_r);
 173
 174   PB_DS_DBG_ONLY(p_target_r->m_p_left = NULL);
 175
 176   PB_DS_DBG_ASSERT(p_target_r->m_p_parent == this->m_p_head);
 177
 178   PB_DS_DBG_ASSERT(this->m_p_head->m_p_parent ==
 179                    p_target_r);
 180
 181   p_target_r->m_p_left = p_l;
 182
 183   if (p_l != NULL)
 184     p_l->m_p_parent = p_target_r;
 185
 186   PB_DS_DBG_ONLY(assert_valid();)
 187
 188     apply_update(p_target_r, (node_update* )this);
 189 }
 190
 191 PB_DS_CLASS_T_DEC
 192 inline typename PB_DS_CLASS_C_DEC::node_pointer
 193 PB_DS_CLASS_C_DEC::
 194 leftmost(node_pointer p_nd)
 195 {
 196   PB_DS_DBG_ASSERT(p_nd != NULL);
 197
 198   while (p_nd->m_p_left != NULL)
 199     p_nd = p_nd->m_p_left;
 200
 201   return (p_nd);
 202 }