]>
Commit | Line | Data |
---|---|---|
fd1e1726 BK |
1 | // -*- C++ -*- |
2 | ||
3 | // Copyright (C) 2005 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 | |
7 | // terms of the GNU General Public License as published by the | |
8 | // Free Software Foundation; either version 2, or (at your option) | |
9 | // any later version. | |
10 | ||
11 | // This library is distributed in the hope that it will be useful, | |
12 | // but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | // GNU General Public License for more details. | |
15 | ||
16 | // You should have received a copy of the GNU General Public License along | |
17 | // with this library; see the file COPYING. If not, write to the Free | |
83f51799 | 18 | // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, |
fd1e1726 BK |
19 | // USA. |
20 | ||
21 | // As a special exception, you may use this file as part of a free software | |
22 | // library without restriction. Specifically, if other files instantiate | |
23 | // templates or use macros or inline functions from this file, or you compile | |
24 | // this file and link it with other files to produce an executable, this | |
25 | // file does not by itself cause the resulting executable to be covered by | |
26 | // the GNU General Public License. This exception does not however | |
27 | // invalidate any other reasons why the executable file might be covered by | |
28 | // the GNU General Public License. | |
29 | ||
30 | // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. | |
31 | ||
32 | // Permission to use, copy, modify, sell, and distribute this software | |
33 | // is hereby granted without fee, provided that the above copyright | |
34 | // notice appears in all copies, and that both that copyright notice and | |
35 | // this permission notice appear in supporting documentation. None of | |
36 | // the above authors, nor IBM Haifa Research Laboratories, make any | |
37 | // representation about the suitability of this software for any | |
38 | // purpose. It is provided "as is" without express or implied warranty. | |
39 | ||
40 | /** | |
41 | * @file r_erase_fn_imps.hpp | |
42 | * Contains an implementation class for bin_search_tree_. | |
43 | */ | |
44 | ||
45 | PB_ASSOC_CLASS_T_DEC | |
46 | inline void | |
47 | PB_ASSOC_CLASS_C_DEC:: | |
48 | actual_erase_node(node_pointer p_z) | |
49 | { | |
50 | PB_ASSOC_DBG_ASSERT(m_size > 0); | |
51 | --m_size; | |
52 | ||
53 | PB_ASSOC_DBG_ONLY(erase_existing(PB_ASSOC_V2F(p_z->m_value))); | |
54 | ||
55 | p_z->~node(); | |
56 | ||
57 | s_node_allocator.deallocate(p_z, 1); | |
58 | } | |
59 | ||
60 | PB_ASSOC_CLASS_T_DEC | |
61 | inline void | |
62 | PB_ASSOC_CLASS_C_DEC:: | |
63 | update_min_max_for_erased_node(node_pointer p_z) | |
64 | { | |
65 | if (m_size == 1) | |
66 | { | |
67 | m_p_head->m_p_left = m_p_head->m_p_right = m_p_head; | |
68 | ||
69 | return; | |
70 | } | |
71 | ||
72 | if (m_p_head->m_p_left == p_z) | |
73 | { | |
74 | iterator it(p_z); | |
75 | ||
76 | ++it; | |
77 | ||
78 | m_p_head->m_p_left = it.m_p_nd; | |
79 | } | |
80 | else if (m_p_head->m_p_right == p_z) | |
81 | { | |
82 | iterator it(p_z); | |
83 | ||
84 | --it; | |
85 | ||
86 | m_p_head->m_p_right = it.m_p_nd; | |
87 | } | |
88 | } | |
89 | ||
90 | PB_ASSOC_CLASS_T_DEC | |
91 | void | |
92 | PB_ASSOC_CLASS_C_DEC:: | |
93 | clear() | |
94 | { | |
95 | PB_ASSOC_DBG_ONLY(assert_valid(true, true);) | |
96 | ||
97 | clear_imp(m_p_head->m_p_parent); | |
98 | ||
99 | m_size = 0; | |
100 | ||
101 | initialize(); | |
102 | ||
103 | PB_ASSOC_DBG_ONLY(my_map_debug_base::clear();) | |
104 | ||
105 | PB_ASSOC_DBG_ONLY(assert_valid(true, true);) | |
106 | } | |
107 | ||
108 | PB_ASSOC_CLASS_T_DEC | |
109 | void | |
110 | PB_ASSOC_CLASS_C_DEC:: | |
111 | clear_imp(node_pointer p_nd) | |
112 | { | |
113 | if (p_nd == NULL) | |
114 | return; | |
115 | ||
116 | clear_imp(p_nd->m_p_left); | |
117 | ||
118 | clear_imp(p_nd->m_p_right); | |
119 | ||
120 | p_nd->~Node(); | |
121 | ||
122 | s_node_allocator.deallocate(p_nd, 1); | |
123 | } | |
124 |