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 an implementation for rc_binomial_heap_.
45 */
46
47PB_DS_CLASS_T_DEC
48inline void
49PB_DS_CLASS_C_DEC::
50pop()
51{
52  make_binomial_heap();
53  _GLIBCXX_DEBUG_ASSERT(!base_type::empty());
54  base_type::pop();
55  base_type::find_max();
56}
57
58PB_DS_CLASS_T_DEC
59void
60PB_DS_CLASS_C_DEC::
61clear()
62{
63  base_type::clear();
64  m_rc.clear();
65}
66
67PB_DS_CLASS_T_DEC
68void
69PB_DS_CLASS_C_DEC::
70make_binomial_heap()
71{
72  node_pointer p_nd = base_type::m_p_root;
73  while (p_nd != NULL)
74    {
75      node_pointer p_next = p_nd->m_p_next_sibling;
76      if (p_next == NULL)
77	p_nd = p_next;
78      else if (p_nd->m_metadata == p_next->m_metadata)
79	p_nd = link_with_next_sibling(p_nd);
80      else if (p_nd->m_metadata < p_next->m_metadata)
81	p_nd = p_next;
82#ifdef _GLIBCXX_DEBUG
83      else
84	_GLIBCXX_DEBUG_ASSERT(0);
85#endif
86    }
87
88  m_rc.clear();
89}
90
91PB_DS_CLASS_T_DEC
92template<typename Pred>
93typename PB_DS_CLASS_C_DEC::size_type
94PB_DS_CLASS_C_DEC::
95erase_if(Pred pred)
96{
97  make_binomial_heap();
98  const size_type ersd = base_type::erase_if(pred);
99  base_type::find_max();
100  _GLIBCXX_DEBUG_ONLY(assert_valid();)
101  return ersd;
102}
103
104PB_DS_CLASS_T_DEC
105void
106PB_DS_CLASS_C_DEC::
107erase(point_iterator it)
108{
109  make_binomial_heap();
110  base_type::erase(it);
111  base_type::find_max();
112}
113
114