1// -*- C++ -*- 2 3// Copyright (C) 2005 Free Software Foundation, Inc. 4// 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 7// terms of the GNU General Public License as published by the 8// Free Software Foundation; either version 2, or (at your option) 9// any later version. 10 11// This library is distributed in the hope that it will be useful, 12// but WITHOUT ANY WARRANTY; without even the implied warranty of 13// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14// GNU General Public License for more details. 15 16// You should have received a copy of the GNU General Public License along 17// with this library; see the file COPYING. If not, write to the Free 18// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, 19// USA. 20 21// As a special exception, you may use this file as part of a free software 22// library without restriction. Specifically, if other files instantiate 23// templates or use macros or inline functions from this file, or you compile 24// this file and link it with other files to produce an executable, this 25// file does not by itself cause the resulting executable to be covered by 26// the GNU General Public License. This exception does not however 27// invalidate any other reasons why the executable file might be covered by 28// the GNU General Public License. 29 30// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 31 32// Permission to use, copy, modify, sell, and distribute this software 33// is hereby granted without fee, provided that the above copyright 34// notice appears in all copies, and that both that copyright notice and 35// this permission notice appear in supporting documentation. None of 36// the above authors, nor IBM Haifa Research Laboratories, make any 37// representation about the suitability of this software for any 38// purpose. It is provided "as is" without express or implied warranty. 39 40/** 41 * @file erase_fn_imps.hpp 42 * Contains implementations of lu_map_. 43 */ 44 45PB_ASSOC_CLASS_T_DEC 46inline typename PB_ASSOC_CLASS_C_DEC::size_type 47PB_ASSOC_CLASS_C_DEC:: 48erase(const_key_reference r_key) 49{ 50 PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();) 51 52 entry_pointer p_l = find_imp(r_key); 53 54 if (p_l->m_p_next == NULL) 55 return (0); 56 57 erase_imp(p_l); 58 59 PB_ASSOC_DBG_ONLY(assert_valid();) 60 61 return (1); 62} 63 64PB_ASSOC_CLASS_T_DEC 65void 66PB_ASSOC_CLASS_C_DEC:: 67clear() 68{ 69 PB_ASSOC_DBG_ONLY(assert_valid();) 70 71 PB_ASSOC_DBG_ONLY(my_map_debug_base::clear();) 72 73 deallocate_all(false); 74 75 m_size = 0; 76 77 PB_ASSOC_DBG_ONLY(assert_valid();) 78 } 79 80PB_ASSOC_CLASS_T_DEC 81template<class Pred> 82inline typename PB_ASSOC_CLASS_C_DEC::size_type 83PB_ASSOC_CLASS_C_DEC:: 84erase_if(Pred& r_pred) 85{ 86 PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();) 87 88 size_type num_ersd = 0; 89 90 entry_pointer p_l = m_p_l; 91 92 while (p_l->m_p_next != NULL) 93 { 94 if (r_pred(p_l->m_p_next->m_value)) 95 { 96 erase_imp(p_l); 97 98 ++num_ersd; 99 } 100 else 101 p_l = p_l->m_p_next; 102 } 103 104 PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();) 105 106 return (num_ersd); 107} 108 109PB_ASSOC_CLASS_T_DEC 110void 111PB_ASSOC_CLASS_C_DEC:: 112erase_imp(entry_pointer p_l) 113{ 114 PB_ASSOC_DBG_ASSERT(p_l->m_p_next != NULL); 115 116 entry_pointer p_next_l = p_l->m_p_next->m_p_next; 117 118 PB_ASSOC_DBG_ONLY(my_map_debug_base::erase_existing( 119 PB_ASSOC_V2F(p_l->m_p_next->m_value));) 120 121 p_l->m_p_next->m_value.~mapped_value_type(); 122 123 s_entry_allocator.deallocate(p_l->m_p_next, 1); 124 125 p_l->m_p_next = p_next_l; 126 127 PB_ASSOC_DBG_ASSERT(m_size > 0); 128 --m_size; 129} 130