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 an implementation for rc_binomial_heap_.
45169691Skan */
46169691Skan
47169691SkanPB_DS_CLASS_T_DEC
48169691Skaninline void
49169691SkanPB_DS_CLASS_C_DEC::
50169691Skanpop()
51169691Skan{
52169691Skan  make_binomial_heap();
53169691Skan  _GLIBCXX_DEBUG_ASSERT(!base_type::empty());
54169691Skan  base_type::pop();
55169691Skan  base_type::find_max();
56169691Skan}
57169691Skan
58169691SkanPB_DS_CLASS_T_DEC
59169691Skanvoid
60169691SkanPB_DS_CLASS_C_DEC::
61169691Skanclear()
62169691Skan{
63169691Skan  base_type::clear();
64169691Skan  m_rc.clear();
65169691Skan}
66169691Skan
67169691SkanPB_DS_CLASS_T_DEC
68169691Skanvoid
69169691SkanPB_DS_CLASS_C_DEC::
70169691Skanmake_binomial_heap()
71169691Skan{
72169691Skan  node_pointer p_nd = base_type::m_p_root;
73169691Skan  while (p_nd != NULL)
74169691Skan    {
75169691Skan      node_pointer p_next = p_nd->m_p_next_sibling;
76169691Skan      if (p_next == NULL)
77169691Skan	p_nd = p_next;
78169691Skan      else if (p_nd->m_metadata == p_next->m_metadata)
79169691Skan	p_nd = link_with_next_sibling(p_nd);
80169691Skan      else if (p_nd->m_metadata < p_next->m_metadata)
81169691Skan	p_nd = p_next;
82169691Skan#ifdef _GLIBCXX_DEBUG
83169691Skan      else
84169691Skan	_GLIBCXX_DEBUG_ASSERT(0);
85169691Skan#endif
86169691Skan    }
87169691Skan
88169691Skan  m_rc.clear();
89169691Skan}
90169691Skan
91169691SkanPB_DS_CLASS_T_DEC
92169691Skantemplate<typename Pred>
93169691Skantypename PB_DS_CLASS_C_DEC::size_type
94169691SkanPB_DS_CLASS_C_DEC::
95169691Skanerase_if(Pred pred)
96169691Skan{
97169691Skan  make_binomial_heap();
98169691Skan  const size_type ersd = base_type::erase_if(pred);
99169691Skan  base_type::find_max();
100169691Skan  _GLIBCXX_DEBUG_ONLY(assert_valid();)
101169691Skan  return ersd;
102169691Skan}
103169691Skan
104169691SkanPB_DS_CLASS_T_DEC
105169691Skanvoid
106169691SkanPB_DS_CLASS_C_DEC::
107169691Skanerase(point_iterator it)
108169691Skan{
109169691Skan  make_binomial_heap();
110169691Skan  base_type::erase(it);
111169691Skan  base_type::find_max();
112169691Skan}
113169691Skan
114