libstdc++
cc_hash_table_map_/erase_fn_imps.hpp
Go to the documentation of this file.
1// -*- C++ -*-
2
3// Copyright (C) 2005-2021 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 cc_hash_table_map_/erase_fn_imps.hpp
38 * Contains implementations of cc_ht_map_'s erase related functions.
39 */
40
41#ifdef PB_DS_CLASS_C_DEC
42
43PB_DS_CLASS_T_DEC
44inline void
45PB_DS_CLASS_C_DEC::
46erase_entry_pointer(entry_pointer& r_p_e)
47{
48 _GLIBCXX_DEBUG_ONLY(debug_base::erase_existing(PB_DS_V2F(r_p_e->m_value)));
49
50 entry_pointer p_e = r_p_e;
51 r_p_e = r_p_e->m_p_next;
52 rels_entry(p_e);
53 _GLIBCXX_DEBUG_ASSERT(m_num_used_e > 0);
54 resize_base::notify_erased(--m_num_used_e);
55}
56
57PB_DS_CLASS_T_DEC
58template<typename Pred>
59inline typename PB_DS_CLASS_C_DEC::size_type
60PB_DS_CLASS_C_DEC::
61erase_if(Pred pred)
62{
63 size_type num_ersd = 0;
64 for (size_type pos = 0; pos < m_num_e; ++pos)
65 {
66 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value))
67 {
68 ++num_ersd;
69 entry_pointer p_next_e = m_entries[pos]->m_p_next;
70 erase_entry_pointer(m_entries[pos]);
71 m_entries[pos] = p_next_e;
72 }
73
74 entry_pointer p_e = m_entries[pos];
75 while (p_e != 0 && p_e->m_p_next != 0)
76 {
77 if (pred(p_e->m_p_next->m_value))
78 {
79 ++num_ersd;
80 erase_entry_pointer(p_e->m_p_next);
81 }
82 else
83 p_e = p_e->m_p_next;
84 }
85 }
86
87 do_resize_if_needed_no_throw();
88 return num_ersd;
89}
90
91PB_DS_CLASS_T_DEC
92void
93PB_DS_CLASS_C_DEC::
94clear()
95{
96 for (size_type pos = 0; pos < m_num_e; ++pos)
97 while (m_entries[pos] != 0)
98 erase_entry_pointer(m_entries[pos]);
99 do_resize_if_needed_no_throw();
100 resize_base::notify_cleared();
101}
102
105
106#endif