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_no_store_hash_fn_imps.hpp
42 * Contains implementations of cc_ht_map_'s insert related functions, when the hash
43 * value is not stored.
47 inline typename PB_ASSOC_CLASS_C_DEC::data_reference
48 PB_ASSOC_CLASS_C_DEC::
49 subscript_imp(const_key_reference r_key, int_to_type<false>)
51 PB_ASSOC_DBG_ONLY(assert_valid();)
53 const size_type pos = my_ranged_hash_fn_base::operator()(r_key);
55 entry_pointer p_e = m_a_p_entries[pos];
57 my_resize_base::notify_insert_search_start();
60 !my_hash_eq_fn_base::operator()(p_e->m_value.first, r_key))
62 my_resize_base::notify_insert_search_collision();
67 my_resize_base::notify_insert_search_end();
71 PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key);)
73 return (p_e->m_value.second);
76 PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(r_key);)
78 return (insert_new_imp(std::make_pair(r_key, data_type()), pos)->second);
82 inline std::pair<typename PB_ASSOC_CLASS_C_DEC::find_iterator, bool>
83 PB_ASSOC_CLASS_C_DEC::
84 insert_imp(const_reference r_val, int_to_type<false>)
86 PB_ASSOC_DBG_ONLY(assert_valid();)
88 const_key_reference r_key = PB_ASSOC_V2F(r_val);
90 const size_type pos = my_ranged_hash_fn_base::operator()(r_key);
92 entry_pointer p_e = m_a_p_entries[pos];
94 my_resize_base::notify_insert_search_start();
97 !my_hash_eq_fn_base::operator()(
98 PB_ASSOC_V2F(p_e->m_value),
101 my_resize_base::notify_insert_search_collision();
106 my_resize_base::notify_insert_search_end();
110 PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key);)
112 return (std::make_pair(&p_e->m_value, false));
115 PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(r_key);)
119 insert_new_imp(r_val, pos),
124 inline typename PB_ASSOC_CLASS_C_DEC::pointer
125 PB_ASSOC_CLASS_C_DEC::
126 insert_new_imp(const_reference r_val, size_type pos)
128 if (do_resize_if_needed())
129 pos = my_ranged_hash_fn_base::operator()(PB_ASSOC_V2F(r_val));
131 // Following lines might throw an exception.
132 entry_pointer p_e = get_entry(r_val, my_traits_base::s_no_throw_copies_indicator);
134 // At this point no exceptions can be thrown.
136 p_e->m_p_next = m_a_p_entries[pos];
138 m_a_p_entries[pos] = p_e;
140 my_resize_base::notify_inserted(++m_num_used_e);
142 PB_ASSOC_DBG_ONLY(my_map_debug_base::insert_new(r_key);)
144 PB_ASSOC_DBG_ONLY(assert_valid();)
146 return (&p_e->m_value);