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