libstdc++
cc_hash_table_map_/erase_no_store_hash_fn_imps.hpp
Go to the documentation of this file.
00001 // -*- C++ -*-
00002 
00003 // Copyright (C) 2005, 2006, 2009, 2010, 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 cc_hash_table_map_/erase_no_store_hash_fn_imps.hpp
00038  * Contains implementations of cc_ht_map_'s erase related functions,
00039  * when the hash value is not stored.
00040  */
00041 
00042 PB_DS_CLASS_T_DEC
00043 inline bool
00044 PB_DS_CLASS_C_DEC::
00045 erase(key_const_reference r_key)
00046 {
00047   PB_DS_ASSERT_VALID((*this))
00048   return erase_in_pos_imp(r_key, ranged_hash_fn_base::operator()(r_key));
00049 }
00050 
00051 PB_DS_CLASS_T_DEC
00052 inline bool
00053 PB_DS_CLASS_C_DEC::
00054 erase_in_pos_imp(key_const_reference r_key, size_type pos)
00055 {
00056   PB_DS_ASSERT_VALID((*this))
00057   entry_pointer p_e = m_entries[pos];
00058   resize_base::notify_erase_search_start();
00059   if (p_e == 0)
00060     {
00061       resize_base::notify_erase_search_end();
00062       PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
00063       PB_DS_ASSERT_VALID((*this))
00064       return false;
00065     }
00066 
00067   if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), r_key))
00068     {
00069       resize_base::notify_erase_search_end();
00070       PB_DS_CHECK_KEY_EXISTS(r_key)
00071       erase_entry_pointer(m_entries[pos]);
00072       do_resize_if_needed_no_throw();
00073       PB_DS_ASSERT_VALID((*this))
00074       return true;
00075     }
00076 
00077   while (true)
00078     {
00079       entry_pointer p_next_e = p_e->m_p_next;
00080       if (p_next_e == 0)
00081     {
00082       resize_base::notify_erase_search_end();
00083       PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
00084       PB_DS_ASSERT_VALID((*this))
00085       return false;
00086     }
00087 
00088       if (hash_eq_fn_base::operator()(PB_DS_V2F(p_next_e->m_value), r_key))
00089     {
00090       resize_base::notify_erase_search_end();
00091       PB_DS_CHECK_KEY_EXISTS(r_key)
00092       erase_entry_pointer(p_e->m_p_next);
00093       do_resize_if_needed_no_throw();
00094       PB_DS_ASSERT_VALID((*this))
00095       return true;
00096     }
00097       resize_base::notify_erase_search_collision();
00098       p_e = p_next_e;
00099     }
00100 }