| // -*- C++ -*- |
| |
| // Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc. |
| // |
| // This file is part of the GNU ISO C++ Library. This library is free |
| // software; you can redistribute it and/or modify it under the terms |
| // of the GNU General Public License as published by the Free Software |
| // Foundation; either version 3, or (at your option) any later |
| // version. |
| |
| // This library is distributed in the hope that it will be useful, but |
| // WITHOUT ANY WARRANTY; without even the implied warranty of |
| // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| // General Public License for more details. |
| |
| // Under Section 7 of GPL version 3, you are granted additional |
| // permissions described in the GCC Runtime Library Exception, version |
| // 3.1, as published by the Free Software Foundation. |
| |
| // You should have received a copy of the GNU General Public License and |
| // a copy of the GCC Runtime Library Exception along with this program; |
| // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see |
| // <http://www.gnu.org/licenses/>. |
| |
| // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. |
| |
| // Permission to use, copy, modify, sell, and distribute this software |
| // is hereby granted without fee, provided that the above copyright |
| // notice appears in all copies, and that both that copyright notice |
| // and this permission notice appear in supporting documentation. None |
| // of the above authors, nor IBM Haifa Research Laboratories, make any |
| // representation about the suitability of this software for any |
| // purpose. It is provided "as is" without express or implied |
| // warranty. |
| |
| /** |
| * @file erase_fn_imps.hpp |
| * Contains implementations of cc_ht_map_'s erase related functions. |
| */ |
| |
| PB_DS_CLASS_T_DEC |
| inline void |
| PB_DS_CLASS_C_DEC:: |
| erase_entry_pointer(entry_pointer& r_p_e) |
| { |
| _GLIBCXX_DEBUG_ONLY(debug_base::erase_existing(PB_DS_V2F(r_p_e->m_value))); |
| |
| entry_pointer p_e = r_p_e; |
| r_p_e = r_p_e->m_p_next; |
| rels_entry(p_e); |
| _GLIBCXX_DEBUG_ASSERT(m_num_used_e > 0); |
| resize_base::notify_erased(--m_num_used_e); |
| } |
| |
| PB_DS_CLASS_T_DEC |
| template<typename Pred> |
| inline typename PB_DS_CLASS_C_DEC::size_type |
| PB_DS_CLASS_C_DEC:: |
| erase_if(Pred pred) |
| { |
| size_type num_ersd = 0; |
| for (size_type pos = 0; pos < m_num_e; ++pos) |
| { |
| while (m_entries[pos] != NULL && pred(m_entries[pos]->m_value)) |
| { |
| ++num_ersd; |
| entry_pointer p_next_e = m_entries[pos]->m_p_next; |
| erase_entry_pointer(m_entries[pos]); |
| m_entries[pos] = p_next_e; |
| } |
| |
| entry_pointer p_e = m_entries[pos]; |
| while (p_e != NULL && p_e->m_p_next != NULL) |
| { |
| if (pred(p_e->m_p_next->m_value)) |
| { |
| ++num_ersd; |
| erase_entry_pointer(p_e->m_p_next); |
| } |
| else |
| p_e = p_e->m_p_next; |
| } |
| } |
| |
| do_resize_if_needed_no_throw(); |
| return num_ersd; |
| } |
| |
| PB_DS_CLASS_T_DEC |
| void |
| PB_DS_CLASS_C_DEC:: |
| clear() |
| { |
| for (size_type pos = 0; pos < m_num_e; ++pos) |
| while (m_entries[pos] != NULL) |
| erase_entry_pointer(m_entries[pos]); |
| do_resize_if_needed_no_throw(); |
| resize_base::notify_cleared(); |
| } |
| |
| #include <ext/pb_ds/detail/cc_hash_table_map_/erase_no_store_hash_fn_imps.hpp> |
| #include <ext/pb_ds/detail/cc_hash_table_map_/erase_store_hash_fn_imps.hpp> |
| |
