]> git.ipfire.org Git - thirdparty/gcc.git/blame - libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/erase_no_store_hash_fn_imps.hpp
* typeck.c (build_modify_expr): Tidy diagnostic message.
[thirdparty/gcc.git] / libstdc++-v3 / include / ext / pb_assoc / detail / cc_ht_map_ / erase_no_store_hash_fn_imps.hpp
CommitLineData
fd1e1726
BK
1// -*- C++ -*-
2
3// Copyright (C) 2005 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
7// terms of the GNU General Public License as published by the
8// Free Software Foundation; either version 2, or (at your option)
9// any later version.
10
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.
15
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
83f51799 18// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
fd1e1726
BK
19// USA.
20
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.
29
30// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
31
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.
39
40/**
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.
44 */
45
46PB_ASSOC_CLASS_T_DEC
47template<class T>
48inline typename PB_ASSOC_CLASS_C_DEC::size_type
49PB_ASSOC_CLASS_C_DEC::
50erase(T r_t, bool erase_entry_if_last, pb_assoc::detail::int_to_type<false>)
51{
52 PB_ASSOC_DBG_ONLY(assert_valid();)
53
54 return (erase_in_pos_imp<T>(r_t,
55 erase_entry_if_last,
56 my_ranged_hash_fn_base::operator()(
57 my_traits_base::ext_eraser::extract_key(r_t))));
58}
59
60PB_ASSOC_CLASS_T_DEC
61template<class T>
62inline typename PB_ASSOC_CLASS_C_DEC::size_type
63PB_ASSOC_CLASS_C_DEC::
64erase_in_pos_imp(T r_t, bool erase_entry_if_last, size_type pos)
65{
66 PB_ASSOC_DBG_ONLY(assert_valid();)
67
68 entry_pointer p_e = m_a_p_entries[pos];
69
70 my_resize_base::notify_erase_search_start();
71
72 if (p_e == NULL)
73 {
74 my_resize_base::notify_erase_search_end();
75
76 PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(
77 ext_eraser::extract_key(r_t));)
78
79 PB_ASSOC_DBG_ONLY(assert_valid();)
80
81 return (0);
82 }
83
84 if (my_hash_eq_fn_base::operator()(
85 p_e->m_value.first,
86 my_traits_base::ext_eraser::extract_key(r_t)))
87 {
88 my_resize_base::notify_erase_search_end();
89
90 PB_ASSOC_DBG_ONLY(my_map_debug_base::
91 check_key_exists(my_traits_base::ext_eraser::extract_key(r_t));)
92
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);
97
98 if (ers_pair.second)
99 {
100 erase_entry_pointer(m_a_p_entries[pos]);
101
102 do_resize_if_needed_no_throw();
103 }
104
105 PB_ASSOC_DBG_ONLY(assert_valid();)
106
107 return (ers_pair.first);
108 }
109
110 while (true)
111 {
112 entry_pointer p_next_e = p_e->m_p_next;
113
114 if (p_next_e == NULL)
115 {
116 my_resize_base::notify_erase_search_end();
117
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));)
121
122 PB_ASSOC_DBG_ONLY(assert_valid();)
123
124 return (0);
125 }
126
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)))
130 {
131 my_resize_base::notify_erase_search_end();
132
133 PB_ASSOC_DBG_ONLY(my_map_debug_base::
134 check_key_exists(
135 my_traits_base::ext_eraser::extract_key(r_t));)
136
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);
141
142 if (ers_pair.second)
143 {
144 erase_entry_pointer(p_e->m_p_next);
145
146 do_resize_if_needed_no_throw();
147 }
148
149 PB_ASSOC_DBG_ONLY(assert_valid();)
150
151 return (ers_pair.first);
152 }
153
154 my_resize_base::notify_erase_search_collision();
155
156 p_e = p_next_e;
157 }
158}
159