libstdc++
|
00001 // -*- C++ -*- 00002 00003 // Copyright (C) 2005, 2006, 2009, 2010, 2011 Free Software Foundation, Inc. 00004 // 00005 // This file is part of the GNU ISO C++ Library. This library is free 00006 // software; you can redistribute it and/or modify it under the terms 00007 // of the GNU General Public License as published by the Free Software 00008 // Foundation; either version 3, or (at your option) any later 00009 // version. 00010 00011 // This library is distributed in the hope that it will be useful, but 00012 // WITHOUT ANY WARRANTY; without even the implied warranty of 00013 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00014 // General Public License for more details. 00015 00016 // Under Section 7 of GPL version 3, you are granted additional 00017 // permissions described in the GCC Runtime Library Exception, version 00018 // 3.1, as published by the Free Software Foundation. 00019 00020 // You should have received a copy of the GNU General Public License and 00021 // a copy of the GCC Runtime Library Exception along with this program; 00022 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see 00023 // <http://www.gnu.org/licenses/>. 00024 00025 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 00026 00027 // Permission to use, copy, modify, sell, and distribute this software 00028 // is hereby granted without fee, provided that the above copyright 00029 // notice appears in all copies, and that both that copyright notice 00030 // and this permission notice appear in supporting documentation. None 00031 // of the above authors, nor IBM Haifa Research Laboratories, make any 00032 // representation about the suitability of this software for any 00033 // purpose. It is provided "as is" without express or implied 00034 // warranty. 00035 00036 /** 00037 * @file bin_search_tree_/r_erase_fn_imps.hpp 00038 * Contains an implementation class for bin_search_tree_. 00039 */ 00040 00041 PB_DS_CLASS_T_DEC 00042 inline void 00043 PB_DS_CLASS_C_DEC:: 00044 actual_erase_node(node_pointer p_z) 00045 { 00046 _GLIBCXX_DEBUG_ASSERT(m_size > 0); 00047 --m_size; 00048 _GLIBCXX_DEBUG_ONLY(erase_existing(PB_DS_V2F(p_z->m_value));) 00049 p_z->~node(); 00050 s_node_allocator.deallocate(p_z, 1); 00051 } 00052 00053 PB_DS_CLASS_T_DEC 00054 inline void 00055 PB_DS_CLASS_C_DEC:: 00056 update_min_max_for_erased_node(node_pointer p_z) 00057 { 00058 if (m_size == 1) 00059 { 00060 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head; 00061 return; 00062 } 00063 00064 if (m_p_head->m_p_left == p_z) 00065 { 00066 iterator it(p_z); 00067 ++it; 00068 m_p_head->m_p_left = it.m_p_nd; 00069 } 00070 else if (m_p_head->m_p_right == p_z) 00071 { 00072 iterator it(p_z); 00073 --it; 00074 m_p_head->m_p_right = it.m_p_nd; 00075 } 00076 } 00077 00078 PB_DS_CLASS_T_DEC 00079 void 00080 PB_DS_CLASS_C_DEC:: 00081 clear() 00082 { 00083 PB_DS_STRUCT_ONLY_ASSERT_VALID((*this)) 00084 clear_imp(m_p_head->m_p_parent); 00085 m_size = 0; 00086 initialize(); 00087 _GLIBCXX_DEBUG_ONLY(debug_base::clear();) 00088 PB_DS_STRUCT_ONLY_ASSERT_VALID((*this)) 00089 } 00090 00091 PB_DS_CLASS_T_DEC 00092 void 00093 PB_DS_CLASS_C_DEC:: 00094 clear_imp(node_pointer p_nd) 00095 { 00096 if (p_nd == 0) 00097 return; 00098 00099 clear_imp(p_nd->m_p_left); 00100 clear_imp(p_nd->m_p_right); 00101 p_nd->~Node(); 00102 s_node_allocator.deallocate(p_nd, 1); 00103 }