// -*- C++ -*-
|
// -*- C++ -*-
|
|
|
// Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc.
|
// Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc.
|
//
|
//
|
// This file is part of the GNU ISO C++ Library. This library is free
|
// This file is part of the GNU ISO C++ Library. This library is free
|
// software; you can redistribute it and/or modify it under the terms
|
// software; you can redistribute it and/or modify it under the terms
|
// of the GNU General Public License as published by the Free Software
|
// of the GNU General Public License as published by the Free Software
|
// Foundation; either version 3, or (at your option) any later
|
// Foundation; either version 3, or (at your option) any later
|
// version.
|
// version.
|
|
|
// This library is distributed in the hope that it will be useful, but
|
// This library is distributed in the hope that it will be useful, but
|
// WITHOUT ANY WARRANTY; without even the implied warranty of
|
// WITHOUT ANY WARRANTY; without even the implied warranty of
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
// General Public License for more details.
|
// General Public License for more details.
|
|
|
// Under Section 7 of GPL version 3, you are granted additional
|
// Under Section 7 of GPL version 3, you are granted additional
|
// permissions described in the GCC Runtime Library Exception, version
|
// permissions described in the GCC Runtime Library Exception, version
|
// 3.1, as published by the Free Software Foundation.
|
// 3.1, as published by the Free Software Foundation.
|
|
|
// You should have received a copy of the GNU General Public License and
|
// You should have received a copy of the GNU General Public License and
|
// a copy of the GCC Runtime Library Exception along with this program;
|
// a copy of the GCC Runtime Library Exception along with this program;
|
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
// <http://www.gnu.org/licenses/>.
|
// <http://www.gnu.org/licenses/>.
|
|
|
// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
|
// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
|
|
|
// Permission to use, copy, modify, sell, and distribute this software
|
// Permission to use, copy, modify, sell, and distribute this software
|
// is hereby granted without fee, provided that the above copyright
|
// is hereby granted without fee, provided that the above copyright
|
// notice appears in all copies, and that both that copyright notice
|
// notice appears in all copies, and that both that copyright notice
|
// and this permission notice appear in supporting documentation. None
|
// and this permission notice appear in supporting documentation. None
|
// of the above authors, nor IBM Haifa Research Laboratories, make any
|
// of the above authors, nor IBM Haifa Research Laboratories, make any
|
// representation about the suitability of this software for any
|
// representation about the suitability of this software for any
|
// purpose. It is provided "as is" without express or implied
|
// purpose. It is provided "as is" without express or implied
|
// warranty.
|
// warranty.
|
|
|
/**
|
/**
|
* @file erase_fn_imps.hpp
|
* @file erase_fn_imps.hpp
|
* Contains an implementation for rc_binomial_heap_.
|
* Contains an implementation for rc_binomial_heap_.
|
*/
|
*/
|
|
|
PB_DS_CLASS_T_DEC
|
PB_DS_CLASS_T_DEC
|
inline void
|
inline void
|
PB_DS_CLASS_C_DEC::
|
PB_DS_CLASS_C_DEC::
|
pop()
|
pop()
|
{
|
{
|
make_binomial_heap();
|
make_binomial_heap();
|
_GLIBCXX_DEBUG_ASSERT(!base_type::empty());
|
_GLIBCXX_DEBUG_ASSERT(!base_type::empty());
|
base_type::pop();
|
base_type::pop();
|
base_type::find_max();
|
base_type::find_max();
|
}
|
}
|
|
|
PB_DS_CLASS_T_DEC
|
PB_DS_CLASS_T_DEC
|
void
|
void
|
PB_DS_CLASS_C_DEC::
|
PB_DS_CLASS_C_DEC::
|
clear()
|
clear()
|
{
|
{
|
base_type::clear();
|
base_type::clear();
|
m_rc.clear();
|
m_rc.clear();
|
}
|
}
|
|
|
PB_DS_CLASS_T_DEC
|
PB_DS_CLASS_T_DEC
|
void
|
void
|
PB_DS_CLASS_C_DEC::
|
PB_DS_CLASS_C_DEC::
|
make_binomial_heap()
|
make_binomial_heap()
|
{
|
{
|
node_pointer p_nd = base_type::m_p_root;
|
node_pointer p_nd = base_type::m_p_root;
|
while (p_nd != NULL)
|
while (p_nd != NULL)
|
{
|
{
|
node_pointer p_next = p_nd->m_p_next_sibling;
|
node_pointer p_next = p_nd->m_p_next_sibling;
|
if (p_next == NULL)
|
if (p_next == NULL)
|
p_nd = p_next;
|
p_nd = p_next;
|
else if (p_nd->m_metadata == p_next->m_metadata)
|
else if (p_nd->m_metadata == p_next->m_metadata)
|
p_nd = link_with_next_sibling(p_nd);
|
p_nd = link_with_next_sibling(p_nd);
|
else if (p_nd->m_metadata < p_next->m_metadata)
|
else if (p_nd->m_metadata < p_next->m_metadata)
|
p_nd = p_next;
|
p_nd = p_next;
|
#ifdef _GLIBCXX_DEBUG
|
#ifdef _GLIBCXX_DEBUG
|
else
|
else
|
_GLIBCXX_DEBUG_ASSERT(0);
|
_GLIBCXX_DEBUG_ASSERT(0);
|
#endif
|
#endif
|
}
|
}
|
|
|
m_rc.clear();
|
m_rc.clear();
|
}
|
}
|
|
|
PB_DS_CLASS_T_DEC
|
PB_DS_CLASS_T_DEC
|
template<typename Pred>
|
template<typename Pred>
|
typename PB_DS_CLASS_C_DEC::size_type
|
typename PB_DS_CLASS_C_DEC::size_type
|
PB_DS_CLASS_C_DEC::
|
PB_DS_CLASS_C_DEC::
|
erase_if(Pred pred)
|
erase_if(Pred pred)
|
{
|
{
|
make_binomial_heap();
|
make_binomial_heap();
|
const size_type ersd = base_type::erase_if(pred);
|
const size_type ersd = base_type::erase_if(pred);
|
base_type::find_max();
|
base_type::find_max();
|
_GLIBCXX_DEBUG_ONLY(assert_valid();)
|
_GLIBCXX_DEBUG_ONLY(assert_valid();)
|
return ersd;
|
return ersd;
|
}
|
}
|
|
|
PB_DS_CLASS_T_DEC
|
PB_DS_CLASS_T_DEC
|
void
|
void
|
PB_DS_CLASS_C_DEC::
|
PB_DS_CLASS_C_DEC::
|
erase(point_iterator it)
|
erase(point_iterator it)
|
{
|
{
|
make_binomial_heap();
|
make_binomial_heap();
|
base_type::erase(it);
|
base_type::erase(it);
|
base_type::find_max();
|
base_type::find_max();
|
}
|
}
|
|
|
|
|
