1// -*- C++ -*-
2
3// Copyright (C) 2005, 2006, 2009 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 3, 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// Under Section 7 of GPL version 3, you are granted additional
17// permissions described in the GCC Runtime Library Exception, version
18// 3.1, as published by the Free Software Foundation.
19
20// You should have received a copy of the GNU General Public License and
21// a copy of the GCC Runtime Library Exception along with this program;
22// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
23// <http://www.gnu.org/licenses/>.
24
25// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
26
27// Permission to use, copy, modify, sell, and distribute this software
28// is hereby granted without fee, provided that the above copyright
29// notice appears in all copies, and that both that copyright notice
30// and this permission notice appear in supporting documentation. None
31// of the above authors, nor IBM Haifa Research Laboratories, make any
32// representation about the suitability of this software for any
33// purpose. It is provided "as is" without express or implied
34// warranty.
35
36/**
37 * @file erase_fn_imps.hpp
38 * Contains implementations of lu_map_.
39 */
40
41PB_DS_CLASS_T_DEC
42inline bool
43PB_DS_CLASS_C_DEC::
44erase(const_key_reference r_key)
45{
46  _GLIBCXX_DEBUG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
47  if (m_p_l == NULL)
48    return false;
49
50  if (s_eq_fn(r_key, PB_DS_V2F(m_p_l->m_value)))
51    {
52      entry_pointer p_next = m_p_l->m_p_next;
53      actual_erase_entry(m_p_l);
54      m_p_l = p_next;
55      return true;
56    }
57
58  entry_pointer p_l = m_p_l;
59  while (p_l->m_p_next != NULL)
60    if (s_eq_fn(r_key, PB_DS_V2F(p_l->m_p_next->m_value)))
61      {
62	erase_next(p_l);
63	return true;
64      }
65    else
66      p_l = p_l->m_p_next;
67  return false;
68}
69
70PB_DS_CLASS_T_DEC
71void
72PB_DS_CLASS_C_DEC::
73clear()
74{
75  deallocate_all();
76}
77
78PB_DS_CLASS_T_DEC
79template<typename Pred>
80inline typename PB_DS_CLASS_C_DEC::size_type
81PB_DS_CLASS_C_DEC::
82erase_if(Pred pred)
83{
84  _GLIBCXX_DEBUG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
85  size_type num_ersd = 0;
86  while (m_p_l != NULL && pred(m_p_l->m_value))
87    {
88      entry_pointer p_next = m_p_l->m_p_next;
89      ++num_ersd;
90      actual_erase_entry(m_p_l);
91      m_p_l = p_next;
92    }
93
94  if (m_p_l == NULL)
95    return num_ersd;
96
97  entry_pointer p_l = m_p_l;
98  while (p_l->m_p_next != NULL)
99    {
100      if (pred(p_l->m_p_next->m_value))
101        {
102	  ++num_ersd;
103	  erase_next(p_l);
104        }
105      else
106	p_l = p_l->m_p_next;
107    }
108
109  _GLIBCXX_DEBUG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
110  return num_ersd;
111}
112
113PB_DS_CLASS_T_DEC
114void
115PB_DS_CLASS_C_DEC::
116erase_next(entry_pointer p_l)
117{
118  _GLIBCXX_DEBUG_ASSERT(p_l != NULL);
119  _GLIBCXX_DEBUG_ASSERT(p_l != m_p_l);
120  _GLIBCXX_DEBUG_ASSERT(p_l->m_p_next != NULL);
121  entry_pointer p_next_l = p_l->m_p_next->m_p_next;
122  actual_erase_entry(p_l->m_p_next);
123  p_l->m_p_next = p_next_l;
124}
125
126PB_DS_CLASS_T_DEC
127void
128PB_DS_CLASS_C_DEC::
129actual_erase_entry(entry_pointer p_l)
130{
131  _GLIBCXX_DEBUG_ONLY(debug_base::erase_existing(PB_DS_V2F(p_l->m_value));)
132  p_l->~entry();
133  s_entry_allocator.deallocate(p_l, 1);
134}
135
136