1169691Skan// -*- C++ -*- 2169691Skan 3169691Skan// Copyright (C) 2005, 2006 Free Software Foundation, Inc. 4169691Skan// 5169691Skan// This file is part of the GNU ISO C++ Library. This library is free 6169691Skan// software; you can redistribute it and/or modify it under the terms 7169691Skan// of the GNU General Public License as published by the Free Software 8169691Skan// Foundation; either version 2, or (at your option) any later 9169691Skan// version. 10169691Skan 11169691Skan// This library is distributed in the hope that it will be useful, but 12169691Skan// WITHOUT ANY WARRANTY; without even the implied warranty of 13169691Skan// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 14169691Skan// General Public License for more details. 15169691Skan 16169691Skan// You should have received a copy of the GNU General Public License 17169691Skan// along with this library; see the file COPYING. If not, write to 18169691Skan// the Free Software Foundation, 59 Temple Place - Suite 330, Boston, 19169691Skan// MA 02111-1307, USA. 20169691Skan 21169691Skan// As a special exception, you may use this file as part of a free 22169691Skan// software library without restriction. Specifically, if other files 23169691Skan// instantiate templates or use macros or inline functions from this 24169691Skan// file, or you compile this file and link it with other files to 25169691Skan// produce an executable, this file does not by itself cause the 26169691Skan// resulting executable to be covered by the GNU General Public 27169691Skan// License. This exception does not however invalidate any other 28169691Skan// reasons why the executable file might be covered by the GNU General 29169691Skan// Public License. 30169691Skan 31169691Skan// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 32169691Skan 33169691Skan// Permission to use, copy, modify, sell, and distribute this software 34169691Skan// is hereby granted without fee, provided that the above copyright 35169691Skan// notice appears in all copies, and that both that copyright notice 36169691Skan// and this permission notice appear in supporting documentation. None 37169691Skan// of the above authors, nor IBM Haifa Research Laboratories, make any 38169691Skan// representation about the suitability of this software for any 39169691Skan// purpose. It is provided "as is" without express or implied 40169691Skan// warranty. 41169691Skan 42169691Skan/** 43169691Skan * @file erase_fn_imps.hpp 44169691Skan * Contains implementations of lu_map_. 45169691Skan */ 46169691Skan 47169691SkanPB_DS_CLASS_T_DEC 48169691Skaninline bool 49169691SkanPB_DS_CLASS_C_DEC:: 50169691Skanerase(const_key_reference r_key) 51169691Skan{ 52169691Skan _GLIBCXX_DEBUG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();) 53169691Skan if (m_p_l == NULL) 54169691Skan return false; 55169691Skan 56169691Skan if (s_eq_fn(r_key, PB_DS_V2F(m_p_l->m_value))) 57169691Skan { 58169691Skan entry_pointer p_next = m_p_l->m_p_next; 59169691Skan actual_erase_entry(m_p_l); 60169691Skan m_p_l = p_next; 61169691Skan return true; 62169691Skan } 63169691Skan 64169691Skan entry_pointer p_l = m_p_l; 65169691Skan while (p_l->m_p_next != NULL) 66169691Skan if (s_eq_fn(r_key, PB_DS_V2F(p_l->m_p_next->m_value))) 67169691Skan { 68169691Skan erase_next(p_l); 69169691Skan return true; 70169691Skan } 71169691Skan else 72169691Skan p_l = p_l->m_p_next; 73169691Skan return false; 74169691Skan} 75169691Skan 76169691SkanPB_DS_CLASS_T_DEC 77169691Skanvoid 78169691SkanPB_DS_CLASS_C_DEC:: 79169691Skanclear() 80169691Skan{ 81169691Skan deallocate_all(); 82169691Skan} 83169691Skan 84169691SkanPB_DS_CLASS_T_DEC 85169691Skantemplate<typename Pred> 86169691Skaninline typename PB_DS_CLASS_C_DEC::size_type 87169691SkanPB_DS_CLASS_C_DEC:: 88169691Skanerase_if(Pred pred) 89169691Skan{ 90169691Skan _GLIBCXX_DEBUG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();) 91169691Skan size_type num_ersd = 0; 92169691Skan while (m_p_l != NULL && pred(m_p_l->m_value)) 93169691Skan { 94169691Skan entry_pointer p_next = m_p_l->m_p_next; 95169691Skan ++num_ersd; 96169691Skan actual_erase_entry(m_p_l); 97169691Skan m_p_l = p_next; 98169691Skan } 99169691Skan 100169691Skan if (m_p_l == NULL) 101169691Skan return num_ersd; 102169691Skan 103169691Skan entry_pointer p_l = m_p_l; 104169691Skan while (p_l->m_p_next != NULL) 105169691Skan { 106169691Skan if (pred(p_l->m_p_next->m_value)) 107169691Skan { 108169691Skan ++num_ersd; 109169691Skan erase_next(p_l); 110169691Skan } 111169691Skan else 112169691Skan p_l = p_l->m_p_next; 113169691Skan } 114169691Skan 115169691Skan _GLIBCXX_DEBUG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();) 116169691Skan return num_ersd; 117169691Skan} 118169691Skan 119169691SkanPB_DS_CLASS_T_DEC 120169691Skanvoid 121169691SkanPB_DS_CLASS_C_DEC:: 122169691Skanerase_next(entry_pointer p_l) 123169691Skan{ 124169691Skan _GLIBCXX_DEBUG_ASSERT(p_l != NULL); 125169691Skan _GLIBCXX_DEBUG_ASSERT(p_l != m_p_l); 126169691Skan _GLIBCXX_DEBUG_ASSERT(p_l->m_p_next != NULL); 127169691Skan entry_pointer p_next_l = p_l->m_p_next->m_p_next; 128169691Skan actual_erase_entry(p_l->m_p_next); 129169691Skan p_l->m_p_next = p_next_l; 130169691Skan} 131169691Skan 132169691SkanPB_DS_CLASS_T_DEC 133169691Skanvoid 134169691SkanPB_DS_CLASS_C_DEC:: 135169691Skanactual_erase_entry(entry_pointer p_l) 136169691Skan{ 137169691Skan _GLIBCXX_DEBUG_ONLY(map_debug_base::erase_existing(PB_DS_V2F(p_l->m_value));) 138169691Skan p_l->~entry(); 139169691Skan s_entry_allocator.deallocate(p_l, 1); 140169691Skan} 141169691Skan 142