libstdc++

gp_hash_table_map_/erase_store_hash_fn_imps.hpp
Go to the documentation of this file.
1 // -*- C++ -*-
2
3 // Copyright (C) 2005-2013 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 gp_hash_table_map_/erase_store_hash_fn_imps.hpp
38 * Contains implementations of gp_ht_map_'s erase related functions,
39 * when the hash value is stored.
40 */
41
42 PB_DS_CLASS_T_DEC
43 inline bool
44 PB_DS_CLASS_C_DEC::
45 erase_imp(key_const_reference r_key, true_type)
46 {
47 const comp_hash pos_hash_pair = ranged_probe_fn_base::operator()(r_key);
48 size_type i;
49 resize_base::notify_erase_search_start();
50 for (i = 0; i < m_num_e; ++i)
51 {
52 const size_type pos = ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i);
53
54 entry* const p_e = m_entries + pos;
55 switch(p_e->m_stat)
56 {
57 case empty_entry_status:
58 {
59 resize_base::notify_erase_search_end();
60 PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
61 return false;
62 }
63 break;
64 case valid_entry_status:
65 if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), p_e->m_hash,
66 r_key, pos_hash_pair.second))
67 {
68 resize_base::notify_erase_search_end();
69 erase_entry(p_e);
70 do_resize_if_needed_no_throw();
71 return true;
72 }
73 break;
74 case erased_entry_status:
75 break;
76 default:
77 _GLIBCXX_DEBUG_ASSERT(0);
78 };
79
80 resize_base::notify_erase_search_collision();
81 }
82 resize_base::notify_erase_search_end();
83 return false;
84 }
85