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