3 // Copyright (C) 2005, 2006 Free Software Foundation, Inc.
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
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.
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.
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
31 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
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
43 * @file r_erase_fn_imps.hpp
44 * Contains an implementation class for bin_search_tree_.
50 actual_erase_node(node_pointer p_z)
52 PB_DS_DBG_ASSERT(m_size > 0);
55 PB_DS_DBG_ONLY(erase_existing(PB_DS_V2F(p_z->m_value)));
59 s_node_allocator.deallocate(p_z, 1);
65 update_min_max_for_erased_node(node_pointer p_z)
69 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
74 if (m_p_head->m_p_left == p_z)
80 m_p_head->m_p_left = it.m_p_nd;
82 else if (m_p_head->m_p_right == p_z)
88 m_p_head->m_p_right = it.m_p_nd;
97 PB_DS_DBG_ONLY(assert_valid(true, true);)
99 clear_imp(m_p_head->m_p_parent);
105 PB_DS_DBG_ONLY(map_debug_base::clear();)
107 PB_DS_DBG_ONLY(assert_valid(true, true);)
113 clear_imp(node_pointer p_nd)
118 clear_imp(p_nd->m_p_left);
120 clear_imp(p_nd->m_p_right);
124 s_node_allocator.deallocate(p_nd, 1);