libstdc++
gp_hash_table_map_/erase_fn_imps.hpp
Go to the documentation of this file.
00001 // -*- C++ -*-
00002 
00003 // Copyright (C) 2005, 2006, 2009, 2011 Free Software Foundation, Inc.
00004 //
00005 // This file is part of the GNU ISO C++ Library.  This library is free
00006 // software; you can redistribute it and/or modify it under the terms
00007 // of the GNU General Public License as published by the Free Software
00008 // Foundation; either version 3, or (at your option) any later
00009 // version.
00010 
00011 // This library is distributed in the hope that it will be useful, but
00012 // WITHOUT ANY WARRANTY; without even the implied warranty of
00013 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
00014 // General Public License for more details.
00015 
00016 // Under Section 7 of GPL version 3, you are granted additional
00017 // permissions described in the GCC Runtime Library Exception, version
00018 // 3.1, as published by the Free Software Foundation.
00019 
00020 // You should have received a copy of the GNU General Public License and
00021 // a copy of the GCC Runtime Library Exception along with this program;
00022 // see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
00023 // <http://www.gnu.org/licenses/>.
00024 
00025 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
00026 
00027 // Permission to use, copy, modify, sell, and distribute this software
00028 // is hereby granted without fee, provided that the above copyright
00029 // notice appears in all copies, and that both that copyright notice
00030 // and this permission notice appear in supporting documentation. None
00031 // of the above authors, nor IBM Haifa Research Laboratories, make any
00032 // representation about the suitability of this software for any
00033 // purpose. It is provided "as is" without express or implied
00034 // warranty.
00035 
00036 /**
00037  * @file gp_hash_table_map_/erase_fn_imps.hpp
00038  * Contains implementations of gp_ht_map_'s erase related functions.
00039  */
00040 
00041 PB_DS_CLASS_T_DEC
00042 inline void
00043 PB_DS_CLASS_C_DEC::
00044 erase_entry(entry_pointer p_e)
00045 {
00046   _GLIBCXX_DEBUG_ASSERT(p_e->m_stat = valid_entry_status);
00047   _GLIBCXX_DEBUG_ONLY(debug_base::erase_existing(PB_DS_V2F(p_e->m_value));)
00048   p_e->m_value.~value_type();
00049   p_e->m_stat = erased_entry_status;
00050   _GLIBCXX_DEBUG_ASSERT(m_num_used_e > 0);
00051   resize_base::notify_erased(--m_num_used_e);
00052 }
00053 
00054 PB_DS_CLASS_T_DEC
00055 void
00056 PB_DS_CLASS_C_DEC::
00057 clear()
00058 {
00059   for (size_type pos = 0; pos < m_num_e; ++pos)
00060     {
00061       entry_pointer p_e = &m_entries[pos];
00062       if (p_e->m_stat == valid_entry_status)
00063     erase_entry(p_e);
00064     }
00065   do_resize_if_needed_no_throw();
00066   resize_base::notify_cleared();
00067 }
00068 
00069 PB_DS_CLASS_T_DEC
00070 template<typename Pred>
00071 inline typename PB_DS_CLASS_C_DEC::size_type
00072 PB_DS_CLASS_C_DEC::
00073 erase_if(Pred pred)
00074 {
00075   PB_DS_ASSERT_VALID((*this))
00076   size_type num_ersd = 0;
00077   for (size_type pos = 0; pos < m_num_e; ++pos)
00078     {
00079       entry_pointer p_e = &m_entries[pos];
00080       if (p_e->m_stat == valid_entry_status)
00081     if (pred(p_e->m_value))
00082       {
00083         ++num_ersd;
00084         erase_entry(p_e);
00085       }
00086     }
00087 
00088   do_resize_if_needed_no_throw();
00089   PB_DS_ASSERT_VALID((*this))
00090   return num_ersd;
00091 }
00092 
00093 PB_DS_CLASS_T_DEC
00094 inline bool
00095 PB_DS_CLASS_C_DEC::
00096 erase(key_const_reference r_key)
00097 { return erase_imp(r_key, traits_base::m_store_extra_indicator); }
00098 
00099 #include <ext/pb_ds/detail/gp_hash_table_map_/erase_no_store_hash_fn_imps.hpp>
00100 #include <ext/pb_ds/detail/gp_hash_table_map_/erase_store_hash_fn_imps.hpp>