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 erase_no_store_hash_fn_imps.hpp
42 * Contains implementations of cc_ht_map_'s erase related functions, when the hash
43 * value is not stored.
48 inline typename PB_ASSOC_CLASS_C_DEC::size_type
49 PB_ASSOC_CLASS_C_DEC::
50 erase(T r_t, bool erase_entry_if_last, pb_assoc::detail::int_to_type<false>)
52 PB_ASSOC_DBG_ONLY(assert_valid();)
54 return (erase_in_pos_imp<T>(r_t,
56 my_ranged_hash_fn_base::operator()(
57 my_traits_base::ext_eraser::extract_key(r_t))));
62 inline typename PB_ASSOC_CLASS_C_DEC::size_type
63 PB_ASSOC_CLASS_C_DEC::
64 erase_in_pos_imp(T r_t, bool erase_entry_if_last, size_type pos)
66 PB_ASSOC_DBG_ONLY(assert_valid();)
68 entry_pointer p_e = m_a_p_entries[pos];
70 my_resize_base::notify_erase_search_start();
74 my_resize_base::notify_erase_search_end();
76 PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(
77 ext_eraser::extract_key(r_t));)
79 PB_ASSOC_DBG_ONLY(assert_valid();)
84 if (my_hash_eq_fn_base::operator()(
86 my_traits_base::ext_eraser::extract_key(r_t)))
88 my_resize_base::notify_erase_search_end();
90 PB_ASSOC_DBG_ONLY(my_map_debug_base::
91 check_key_exists(my_traits_base::ext_eraser::extract_key(r_t));)
93 std::pair<size_type, bool> ers_pair =
94 my_traits_base::ext_eraser::erase(
95 PB_ASSOC_EP2VP(m_a_p_entries[pos]),
96 r_t, erase_entry_if_last);
100 erase_entry_pointer(m_a_p_entries[pos]);
102 do_resize_if_needed_no_throw();
105 PB_ASSOC_DBG_ONLY(assert_valid();)
107 return (ers_pair.first);
112 entry_pointer p_next_e = p_e->m_p_next;
114 if (p_next_e == NULL)
116 my_resize_base::notify_erase_search_end();
118 PB_ASSOC_DBG_ONLY(my_map_debug_base::
119 check_key_does_not_exist(
120 my_traits_base::ext_eraser::extract_key(r_t));)
122 PB_ASSOC_DBG_ONLY(assert_valid();)
127 if (my_hash_eq_fn_base::operator()(
128 p_next_e->m_value.first,
129 my_traits_base::ext_eraser::extract_key(r_t)))
131 my_resize_base::notify_erase_search_end();
133 PB_ASSOC_DBG_ONLY(my_map_debug_base::
135 my_traits_base::ext_eraser::extract_key(r_t));)
137 std::pair<size_type, bool> ers_pair =
138 my_traits_base::ext_eraser::erase(
139 PB_ASSOC_EP2VP(p_e->m_p_next),
140 r_t, erase_entry_if_last);
144 erase_entry_pointer(p_e->m_p_next);
146 do_resize_if_needed_no_throw();
149 PB_ASSOC_DBG_ONLY(assert_valid();)
151 return (ers_pair.first);
154 my_resize_base::notify_erase_search_collision();