3 // Copyright (C) 2005, 2006, 2009, 2010 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 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
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.
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.
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/>.
25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
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
37 * @file cc_hash_table_map_/erase_fn_imps.hpp
38 * Contains implementations of cc_ht_map_'s erase related functions.
44 erase_entry_pointer(entry_pointer& r_p_e)
46 _GLIBCXX_DEBUG_ONLY(debug_base::erase_existing(PB_DS_V2F(r_p_e->m_value)));
48 entry_pointer p_e = r_p_e;
49 r_p_e = r_p_e->m_p_next;
51 _GLIBCXX_DEBUG_ASSERT(m_num_used_e > 0);
52 resize_base::notify_erased(--m_num_used_e);
56 template<typename Pred>
57 inline typename PB_DS_CLASS_C_DEC::size_type
61 size_type num_ersd = 0;
62 for (size_type pos = 0; pos < m_num_e; ++pos)
64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value))
67 entry_pointer p_next_e = m_entries[pos]->m_p_next;
68 erase_entry_pointer(m_entries[pos]);
69 m_entries[pos] = p_next_e;
72 entry_pointer p_e = m_entries[pos];
73 while (p_e != 0 && p_e->m_p_next != 0)
75 if (pred(p_e->m_p_next->m_value))
78 erase_entry_pointer(p_e->m_p_next);
85 do_resize_if_needed_no_throw();
94 for (size_type pos = 0; pos < m_num_e; ++pos)
95 while (m_entries[pos] != 0)
96 erase_entry_pointer(m_entries[pos]);
97 do_resize_if_needed_no_throw();
98 resize_base::notify_cleared();
101 #include <ext/pb_ds/detail/cc_hash_table_map_/erase_no_store_hash_fn_imps.hpp>
102 #include <ext/pb_ds/detail/cc_hash_table_map_/erase_store_hash_fn_imps.hpp>