libstdc++: constructor_destructor_fn_imps.hpp Source File

libstdc++

gp_hash_table_map_/constructor_destructor_fn_imps.hpp
Go to the documentation of this file.
1// -*- C++ -*-
2
3// Copyright (C) 2005-2026 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 gp_hash_table_map_/constructor_destructor_fn_imps.hpp
38 * Contains implementations of gp_ht_map_'s constructors, destructor,
39 * and related functions.
40 */
41
42#ifdef PB_DS_CLASS_C_DEC
43
44PB_DS_CLASS_T_DEC
45typename PB_DS_CLASS_C_DEC::entry_allocator
46PB_DS_CLASS_C_DEC::s_entry_allocator;
47
48PB_DS_CLASS_T_DEC
49template<typename It>
50void
51PB_DS_CLASS_C_DEC::
52copy_from_range(It first_it, It last_it)
53{
54 while (first_it != last_it)
55 insert(*(first_it++));
56}
57
58PB_DS_CLASS_T_DEC
59PB_DS_CLASS_C_DEC::
60PB_DS_GP_HASH_NAME()
61: ranged_probe_fn_base(resize_base::get_nearest_larger_size(1)),
62 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0),
63 m_entries(s_entry_allocator.allocate(m_num_e))
64{
65 initialize();
66 PB_DS_ASSERT_VALID((*this))
67}
68
69PB_DS_CLASS_T_DEC
70PB_DS_CLASS_C_DEC::
71PB_DS_GP_HASH_NAME(const Hash_Fn& r_hash_fn)
72: ranged_probe_fn_base(resize_base::get_nearest_larger_size(1), r_hash_fn),
73 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0),
74 m_entries(s_entry_allocator.allocate(m_num_e))
75{
76 initialize();
77 PB_DS_ASSERT_VALID((*this))
78}
79
80PB_DS_CLASS_T_DEC
81PB_DS_CLASS_C_DEC::
82PB_DS_GP_HASH_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn)
83: hash_eq_fn_base(r_eq_fn),
84 ranged_probe_fn_base(resize_base::get_nearest_larger_size(1), r_hash_fn),
85 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0),
86 m_entries(s_entry_allocator.allocate(m_num_e))
87{
88 initialize();
89 PB_DS_ASSERT_VALID((*this))
90}
91
92PB_DS_CLASS_T_DEC
93PB_DS_CLASS_C_DEC::
94PB_DS_GP_HASH_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn,
95 const Comb_Probe_Fn& r_comb_hash_fn)
96: hash_eq_fn_base(r_eq_fn),
97 ranged_probe_fn_base(resize_base::get_nearest_larger_size(1),
98 r_hash_fn, r_comb_hash_fn),
99 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0),
100 m_entries(s_entry_allocator.allocate(m_num_e))
101{
102 initialize();
103 PB_DS_ASSERT_VALID((*this))
104}
105
106PB_DS_CLASS_T_DEC
107PB_DS_CLASS_C_DEC::
108PB_DS_GP_HASH_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn,
109 const Comb_Probe_Fn& comb_hash_fn, const Probe_Fn& prober)
110: hash_eq_fn_base(r_eq_fn),
111 ranged_probe_fn_base(resize_base::get_nearest_larger_size(1),
112 r_hash_fn, comb_hash_fn, prober),
113 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0),
114 m_entries(s_entry_allocator.allocate(m_num_e))
115{
116 initialize();
117 PB_DS_ASSERT_VALID((*this))
118}
119
120PB_DS_CLASS_T_DEC
121PB_DS_CLASS_C_DEC::
122PB_DS_GP_HASH_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn,
123 const Comb_Probe_Fn& comb_hash_fn, const Probe_Fn& prober,
124 const Resize_Policy& r_resize_policy)
125: hash_eq_fn_base(r_eq_fn), resize_base(r_resize_policy),
126 ranged_probe_fn_base(resize_base::get_nearest_larger_size(1),
127 r_hash_fn, comb_hash_fn, prober),
128 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0),
129 m_entries(s_entry_allocator.allocate(m_num_e))
130{
131 initialize();
132 PB_DS_ASSERT_VALID((*this))
133}
134
135PB_DS_CLASS_T_DEC
136PB_DS_CLASS_C_DEC::
137PB_DS_GP_HASH_NAME(const PB_DS_CLASS_C_DEC& other) :
138#ifdef _GLIBCXX_DEBUG
139 debug_base(other),
140#endif
141 hash_eq_fn_base(other),
142 resize_base(other),
143 ranged_probe_fn_base(other),
144 m_num_e(other.m_num_e),
145 m_num_used_e(other.m_num_used_e),
146 m_entries(s_entry_allocator.allocate(m_num_e))
147{
148 for (size_type i = 0; i < m_num_e; ++i)
149 m_entries[i].m_stat = (entry_status)empty_entry_status;
150
151 __try
152 {
153 for (size_type i = 0; i < m_num_e; ++i)
154 {
155 m_entries[i].m_stat = other.m_entries[i].m_stat;
156 if (m_entries[i].m_stat == valid_entry_status)
157 new (m_entries + i) entry(other.m_entries[i]);
158 }
159 }
160 __catch(...)
161 {
162 deallocate_all();
163 __throw_exception_again;
164 }
165 PB_DS_ASSERT_VALID((*this))
166}
167
168PB_DS_CLASS_T_DEC
169PB_DS_CLASS_C_DEC::
170~PB_DS_GP_HASH_NAME()
171{ deallocate_all(); }
172
173PB_DS_CLASS_T_DEC
174void
175PB_DS_CLASS_C_DEC::
176swap(PB_DS_CLASS_C_DEC& other)
177{
178 PB_DS_ASSERT_VALID((*this))
179 PB_DS_ASSERT_VALID(other)
180 std::swap(m_num_e, other.m_num_e);
181 std::swap(m_num_used_e, other.m_num_used_e);
182 std::swap(m_entries, other.m_entries);
183 ranged_probe_fn_base::swap(other);
184 hash_eq_fn_base::swap(other);
185 resize_base::swap(other);
186 _GLIBCXX_DEBUG_ONLY(debug_base::swap(other));
187 PB_DS_ASSERT_VALID((*this))
188 PB_DS_ASSERT_VALID(other)
189}
190
191PB_DS_CLASS_T_DEC
192void
193PB_DS_CLASS_C_DEC::
194deallocate_all()
195{
196 clear();
197 erase_all_valid_entries(m_entries, m_num_e);
198 s_entry_allocator.deallocate(m_entries, m_num_e);
199}
200
201PB_DS_CLASS_T_DEC
202void
203PB_DS_CLASS_C_DEC::
204erase_all_valid_entries(entry_array a_entries_resized, size_type len)
205{
206 for (size_type pos = 0; pos < len; ++pos)
207 {
208 entry_pointer p_e = &a_entries_resized[pos];
209 if (p_e->m_stat == valid_entry_status)
210 p_e->m_value.~value_type();
211 }
212}
213
214PB_DS_CLASS_T_DEC
215void
216PB_DS_CLASS_C_DEC::
217initialize()
218{
219 Resize_Policy::notify_resized(m_num_e);
220 Resize_Policy::notify_cleared();
221 ranged_probe_fn_base::notify_resized(m_num_e);
222 for (size_type i = 0; i < m_num_e; ++i)
223 m_entries[i].m_stat = empty_entry_status;
224}
225
226#endif
std
ISO C++ entities toplevel namespace is std.