libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/erase_fn_imps.hpp

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