3 // Copyright (C) 2005 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
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 2, or (at your option)
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.
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
18 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
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.
30 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
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.
41 * @file insert_store_hash_fn_imps.hpp
42 * Contains implementations of gp_ht_map_'s find related functions, when the hash
47 inline typename PB_ASSOC_CLASS_C_DEC::comp_hash
48 PB_ASSOC_CLASS_C_DEC::
49 find_ins_pos(const_key_reference r_key, int_to_type<true>)
51 PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
53 comp_hash pos_hash_pair = my_ranged_probe_fn_base::operator()(r_key);
57 /* The insertion position is initted to a non-legal value to indicate
58 * that it has not been initted yet.
60 size_type ins_pos = m_num_e;
62 my_resize_base::notify_insert_search_start();
64 for (i = 0; i < m_num_e; ++i)
67 my_ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i);
69 entry* const p_e = m_a_entries + pos;
73 case EMPTY_ENTRY_STATUS:
75 my_resize_base::notify_insert_search_end();
78 my_map_debug_base::check_key_does_not_exist(r_key);)
80 return ((ins_pos == m_num_e)?
81 std::make_pair(pos, pos_hash_pair.second) :
82 std::make_pair(ins_pos, pos_hash_pair.second));
85 case ERASED_ENTRY_STATUS:
86 if (ins_pos == m_num_e)
89 case VALID_ENTRY_STATUS:
90 if (my_hash_eq_fn_base::operator()(
91 PB_ASSOC_V2F(p_e->m_value),
94 pos_hash_pair.second))
96 my_resize_base::notify_insert_search_end();
98 PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key);)
100 return (std::make_pair(pos, pos_hash_pair.second));
104 PB_ASSOC_DBG_ASSERT(0);
107 my_resize_base::notify_insert_search_collision();
110 my_resize_base::notify_insert_search_end();
112 if (ins_pos == m_num_e)
113 throw cannot_insert();
115 return (std::make_pair(ins_pos, pos_hash_pair.second));
119 inline typename PB_ASSOC_CLASS_C_DEC::data_reference
120 PB_ASSOC_CLASS_C_DEC::
121 subscript_imp(const_key_reference r_key, int_to_type<true>)
123 PB_ASSOC_DBG_ONLY(assert_valid();)
125 comp_hash pos_hash_pair =
126 find_ins_pos(r_key, my_hash_traits_base::s_store_hash_indicator);
128 if (m_a_entries[pos_hash_pair.first].m_stat != VALID_ENTRY_STATUS)
129 return (insert_new_imp(
130 value_type(r_key, Data()), pos_hash_pair)->second);
132 PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key));
134 return ((m_a_entries + pos_hash_pair.first)->m_value.second);
138 inline std::pair<typename PB_ASSOC_CLASS_C_DEC::find_iterator, bool>
139 PB_ASSOC_CLASS_C_DEC::
140 insert_imp(const_reference r_val, int_to_type<true>)
142 const_key_reference r_key = PB_ASSOC_V2F(r_val);
144 comp_hash pos_hash_pair =
145 find_ins_pos(r_key, my_hash_traits_base::s_store_hash_indicator);
147 entry_pointer p_e =& m_a_entries[pos_hash_pair.first];
149 if (p_e->m_stat == VALID_ENTRY_STATUS)
151 PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key));
153 return (std::make_pair(&p_e->m_value, false));
156 PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(r_key));
158 return (std::make_pair(
159 insert_new_imp(r_val, pos_hash_pair),
164 inline typename PB_ASSOC_CLASS_C_DEC::pointer
165 PB_ASSOC_CLASS_C_DEC::
166 insert_new_imp(const_reference r_val, comp_hash& r_pos_hash_pair)
168 PB_ASSOC_DBG_ASSERT(m_a_entries[r_pos_hash_pair.first].m_stat !=
171 if (do_resize_if_needed())
172 r_pos_hash_pair = find_ins_pos(
174 my_hash_traits_base::s_store_hash_indicator);
176 PB_ASSOC_DBG_ASSERT(m_a_entries[r_pos_hash_pair.first].m_stat !=
179 entry* const p_e = m_a_entries + r_pos_hash_pair.first;
181 new (&p_e->m_value) value_type(r_val);
183 p_e->m_hash = r_pos_hash_pair.second;
185 p_e->m_stat = VALID_ENTRY_STATUS;
187 my_resize_base::notify_inserted(++m_num_used_e);
189 PB_ASSOC_DBG_ONLY(my_map_debug_base::insert_new(p_e->m_value.first);)
191 PB_ASSOC_DBG_ONLY(assert_valid();)
193 return (static_cast<pointer>(&p_e->m_value));