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