libstdc++
cc_hash_table_map_/erase_fn_imps.hpp
Go to the documentation of this file.
00001 // -*- C++ -*-
00002 
00003 // Copyright (C) 2005, 2006, 2009, 2010 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 cc_hash_table_map_/erase_fn_imps.hpp
00038  * Contains implementations of cc_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_pointer(entry_pointer& r_p_e)
00045 {
00046   _GLIBCXX_DEBUG_ONLY(debug_base::erase_existing(PB_DS_V2F(r_p_e->m_value)));
00047 
00048   entry_pointer p_e = r_p_e;
00049   r_p_e = r_p_e->m_p_next;
00050   rels_entry(p_e);
00051   _GLIBCXX_DEBUG_ASSERT(m_num_used_e > 0);
00052   resize_base::notify_erased(--m_num_used_e);
00053 }
00054 
00055 PB_DS_CLASS_T_DEC
00056 template<typename Pred>
00057 inline typename PB_DS_CLASS_C_DEC::size_type
00058 PB_DS_CLASS_C_DEC::
00059 erase_if(Pred pred)
00060 {
00061   size_type num_ersd = 0;
00062   for (size_type pos = 0; pos < m_num_e; ++pos)
00063     {
00064       while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value))
00065         {
00066       ++num_ersd;
00067       entry_pointer p_next_e = m_entries[pos]->m_p_next;
00068       erase_entry_pointer(m_entries[pos]);
00069       m_entries[pos] = p_next_e;
00070         }
00071 
00072       entry_pointer p_e = m_entries[pos];
00073       while (p_e != 0 && p_e->m_p_next != 0)
00074         {
00075       if (pred(p_e->m_p_next->m_value))
00076             {
00077           ++num_ersd;
00078           erase_entry_pointer(p_e->m_p_next);
00079             }
00080       else
00081         p_e = p_e->m_p_next;
00082         }
00083     }
00084 
00085   do_resize_if_needed_no_throw();
00086   return num_ersd;
00087 }
00088 
00089 PB_DS_CLASS_T_DEC
00090 void
00091 PB_DS_CLASS_C_DEC::
00092 clear()
00093 {
00094   for (size_type pos = 0; pos < m_num_e; ++pos)
00095     while (m_entries[pos] != 0)
00096       erase_entry_pointer(m_entries[pos]);
00097   do_resize_if_needed_no_throw();
00098   resize_base::notify_cleared();
00099 }
00100 
00101 #include <ext/pb_ds/detail/cc_hash_table_map_/erase_no_store_hash_fn_imps.hpp>
00102 #include <ext/pb_ds/detail/cc_hash_table_map_/erase_store_hash_fn_imps.hpp>
00103