1// -*- C++ -*- 2 3// Copyright (C) 2005-2022 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 cc_hash_table_map_/constructor_destructor_fn_imps.hpp 38 * Contains implementations of cc_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 49typename PB_DS_CLASS_C_DEC::entry_pointer_allocator 50PB_DS_CLASS_C_DEC::s_entry_pointer_allocator; 51 52PB_DS_CLASS_T_DEC 53template<typename It> 54void 55PB_DS_CLASS_C_DEC:: 56copy_from_range(It first_it, It last_it) 57{ 58 while (first_it != last_it) 59 insert(*(first_it++)); 60} 61 62PB_DS_CLASS_T_DEC 63PB_DS_CLASS_C_DEC:: 64PB_DS_CC_HASH_NAME() : 65 ranged_hash_fn_base(resize_base::get_nearest_larger_size(1)), 66 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0), 67 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) 68{ 69 initialize(); 70 PB_DS_ASSERT_VALID((*this)) 71} 72 73PB_DS_CLASS_T_DEC 74PB_DS_CLASS_C_DEC:: 75PB_DS_CC_HASH_NAME(const Hash_Fn& r_hash_fn) : 76 ranged_hash_fn_base(resize_base::get_nearest_larger_size(1), r_hash_fn), 77 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0), 78 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) 79{ 80 initialize(); 81 PB_DS_ASSERT_VALID((*this)) 82} 83 84PB_DS_CLASS_T_DEC 85PB_DS_CLASS_C_DEC:: 86PB_DS_CC_HASH_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn) : 87 PB_DS_HASH_EQ_FN_C_DEC(r_eq_fn), 88 ranged_hash_fn_base(resize_base::get_nearest_larger_size(1), r_hash_fn), 89 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0), 90 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) 91{ 92 std::fill(m_entries, m_entries + m_num_e, (entry_pointer)0); 93 Resize_Policy::notify_cleared(); 94 ranged_hash_fn_base::notify_resized(m_num_e); 95 PB_DS_ASSERT_VALID((*this)) 96} 97 98PB_DS_CLASS_T_DEC 99PB_DS_CLASS_C_DEC:: 100PB_DS_CC_HASH_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, 101 const Comb_Hash_Fn& r_comb_hash_fn) : 102 PB_DS_HASH_EQ_FN_C_DEC(r_eq_fn), 103 ranged_hash_fn_base(resize_base::get_nearest_larger_size(1), 104 r_hash_fn, r_comb_hash_fn), 105 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0), 106 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) 107{ 108 initialize(); 109 PB_DS_ASSERT_VALID((*this)) 110} 111 112PB_DS_CLASS_T_DEC 113PB_DS_CLASS_C_DEC:: 114PB_DS_CC_HASH_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, 115 const Comb_Hash_Fn& r_comb_hash_fn, 116 const Resize_Policy& r_resize_policy) : 117 PB_DS_HASH_EQ_FN_C_DEC(r_eq_fn), 118 Resize_Policy(r_resize_policy), 119 ranged_hash_fn_base(resize_base::get_nearest_larger_size(1), 120 r_hash_fn, r_comb_hash_fn), 121 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0), 122 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) 123{ 124 initialize(); 125 PB_DS_ASSERT_VALID((*this)) 126} 127 128PB_DS_CLASS_T_DEC 129PB_DS_CLASS_C_DEC:: 130PB_DS_CC_HASH_NAME(const PB_DS_CLASS_C_DEC& other) : 131 PB_DS_HASH_EQ_FN_C_DEC(other), 132 resize_base(other), ranged_hash_fn_base(other), 133 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0), 134 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) 135{ 136 initialize(); 137 PB_DS_ASSERT_VALID((*this)) 138 __try 139 { 140 copy_from_range(other.begin(), other.end()); 141 } 142 __catch(...) 143 { 144 deallocate_all(); 145 __throw_exception_again; 146 } 147 PB_DS_ASSERT_VALID((*this)) 148} 149 150PB_DS_CLASS_T_DEC 151PB_DS_CLASS_C_DEC:: 152~PB_DS_CC_HASH_NAME() 153{ deallocate_all(); } 154 155PB_DS_CLASS_T_DEC 156void 157PB_DS_CLASS_C_DEC:: 158swap(PB_DS_CLASS_C_DEC& other) 159{ 160 PB_DS_ASSERT_VALID((*this)) 161 PB_DS_ASSERT_VALID(other) 162 163 std::swap(m_entries, other.m_entries); 164 std::swap(m_num_e, other.m_num_e); 165 std::swap(m_num_used_e, other.m_num_used_e); 166 ranged_hash_fn_base::swap(other); 167 hash_eq_fn_base::swap(other); 168 resize_base::swap(other); 169 170 _GLIBCXX_DEBUG_ONLY(debug_base::swap(other)); 171 PB_DS_ASSERT_VALID((*this)) 172 PB_DS_ASSERT_VALID(other) 173} 174 175PB_DS_CLASS_T_DEC 176void 177PB_DS_CLASS_C_DEC:: 178deallocate_all() 179{ 180 clear(); 181 s_entry_pointer_allocator.deallocate(m_entries, m_num_e); 182} 183 184PB_DS_CLASS_T_DEC 185void 186PB_DS_CLASS_C_DEC:: 187initialize() 188{ 189 std::fill(m_entries, m_entries + m_num_e, entry_pointer(0)); 190 Resize_Policy::notify_resized(m_num_e); 191 Resize_Policy::notify_cleared(); 192 ranged_hash_fn_base::notify_resized(m_num_e); 193} 194#endif 195