libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/r_erase_fn_imps.hpp

   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 bin_search_tree_/r_erase_fn_imps.hpp
  38  * Contains an implementation class for bin_search_tree_.
  39  */
  40
  41 #ifdef PB_DS_CLASS_C_DEC
  42
  43 PB_DS_CLASS_T_DEC
  44 inline void
  45 PB_DS_CLASS_C_DEC::
  46 actual_erase_node(node_pointer p_z)
  47 {
  48   _GLIBCXX_DEBUG_ASSERT(m_size > 0);
  49   --m_size;
  50   _GLIBCXX_DEBUG_ONLY(erase_existing(PB_DS_V2F(p_z->m_value));)
  51   p_z->~node();
  52   s_node_allocator.deallocate(p_z, 1);
  53 }
  54
  55 PB_DS_CLASS_T_DEC
  56 inline void
  57 PB_DS_CLASS_C_DEC::
  58 update_min_max_for_erased_node(node_pointer p_z)
  59 {
  60   if (m_size == 1)
  61     {
  62       m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
  63       return;
  64     }
  65
  66   if (m_p_head->m_p_left == p_z)
  67     {
  68       iterator it(p_z);
  69       ++it;
  70       m_p_head->m_p_left = it.m_p_nd;
  71     }
  72   else if (m_p_head->m_p_right == p_z)
  73     {
  74       iterator it(p_z);
  75       --it;
  76       m_p_head->m_p_right = it.m_p_nd;
  77     }
  78 }
  79
  80 PB_DS_CLASS_T_DEC
  81 void
  82 PB_DS_CLASS_C_DEC::
  83 clear()
  84 {
  85   PB_DS_STRUCT_ONLY_ASSERT_VALID((*this))
  86   clear_imp(m_p_head->m_p_parent);
  87   m_size = 0;
  88   initialize();
  89   _GLIBCXX_DEBUG_ONLY(debug_base::clear();)
  90   PB_DS_STRUCT_ONLY_ASSERT_VALID((*this))
  91 }
  92
  93 PB_DS_CLASS_T_DEC
  94 void
  95 PB_DS_CLASS_C_DEC::
  96 clear_imp(node_pointer p_nd)
  97 {
  98   if (p_nd == 0)
  99     return;
 100
 101   clear_imp(p_nd->m_p_left);
 102   clear_imp(p_nd->m_p_right);
 103   p_nd->~Node();
 104   s_node_allocator.deallocate(p_nd, 1);
 105 }
 106 #endif