Subversion Repositories altor32

// -*- C++ -*-

// Copyright (C) 2005, 2006, 2009, 2010, 2011 Free Software Foundation, Inc.

//

// 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

// of the GNU General Public License as published by the Free Software

// Foundation; either version 3, or (at your option) any later

// version.

// This library is distributed in the hope that it will be useful, but

// WITHOUT ANY WARRANTY; without even the implied warranty of

// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU

// General Public License for more details.

// Under Section 7 of GPL version 3, you are granted additional

// permissions described in the GCC Runtime Library Exception, version

// 3.1, as published by the Free Software Foundation.

// 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;

// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see

// <http://www.gnu.org/licenses/>.

// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.

// Permission to use, copy, modify, sell, and distribute this software

// is hereby granted without fee, provided that the above copyright

// notice appears in all copies, and that both that copyright notice

// and this permission notice appear in supporting documentation. None

// of the above authors, nor IBM Haifa Research Laboratories, make any

// representation about the suitability of this software for any

// purpose. It is provided "as is" without express or implied

// warranty.

/**

 * @file left_child_next_sibling_heap_/erase_fn_imps.hpp

 * Contains an implementation class for left_child_next_sibling_heap_.

 */

PB_DS_CLASS_T_DEC

void

PB_DS_CLASS_C_DEC::

clear()

{

  clear_imp(m_p_root);

  _GLIBCXX_DEBUG_ASSERT(m_size == 0);

  m_p_root = 0;

}

PB_DS_CLASS_T_DEC

inline void

PB_DS_CLASS_C_DEC::

actual_erase_node(node_pointer p_nd)

{

  _GLIBCXX_DEBUG_ASSERT(m_size > 0);

  --m_size;

  p_nd->~node();

  s_node_allocator.deallocate(p_nd, 1);

}

PB_DS_CLASS_T_DEC

void

PB_DS_CLASS_C_DEC::

clear_imp(node_pointer p_nd)

{

  while (p_nd != 0)

    {

      clear_imp(p_nd->m_p_l_child);

      node_pointer p_next = p_nd->m_p_next_sibling;

      actual_erase_node(p_nd);

      p_nd = p_next;

    }

}

PB_DS_CLASS_T_DEC

void

PB_DS_CLASS_C_DEC::

to_linked_list()

{

  PB_DS_ASSERT_VALID((*this))

  node_pointer p_cur = m_p_root;

  while (p_cur != 0)

    if (p_cur->m_p_l_child != 0)

      {

        node_pointer p_child_next = p_cur->m_p_l_child->m_p_next_sibling;

        p_cur->m_p_l_child->m_p_next_sibling = p_cur->m_p_next_sibling;

        p_cur->m_p_next_sibling = p_cur->m_p_l_child;

        p_cur->m_p_l_child = p_child_next;

      }

    else

      p_cur = p_cur->m_p_next_sibling;

#ifdef _GLIBCXX_DEBUG

  node_const_pointer p_counter = m_p_root;

  size_type count = 0;

  while (p_counter != 0)

    {

      ++count;

      _GLIBCXX_DEBUG_ASSERT(p_counter->m_p_l_child == 0);

      p_counter = p_counter->m_p_next_sibling;

    }

  _GLIBCXX_DEBUG_ASSERT(count == m_size);

#endif 

}

PB_DS_CLASS_T_DEC

template<typename Pred>

typename PB_DS_CLASS_C_DEC::node_pointer

PB_DS_CLASS_C_DEC::

prune(Pred pred)

{

  node_pointer p_cur = m_p_root;

  m_p_root = 0;

  node_pointer p_out = 0;

  while (p_cur != 0)

    {

      node_pointer p_next = p_cur->m_p_next_sibling;

      if (pred(p_cur->m_value))

        {

          p_cur->m_p_next_sibling = p_out;

          if (p_out != 0)

            p_out->m_p_prev_or_parent = p_cur;

          p_out = p_cur;

        }

      else

        {

          p_cur->m_p_next_sibling = m_p_root;

          if (m_p_root != 0)

            m_p_root->m_p_prev_or_parent = p_cur;

          m_p_root = p_cur;

        }

      p_cur = p_next;

    }

  return p_out;

}

PB_DS_CLASS_T_DEC

void

PB_DS_CLASS_C_DEC::

bubble_to_top(node_pointer p_nd)

{

  node_pointer p_parent = parent(p_nd);

  while (p_parent != 0)

    {

      swap_with_parent(p_nd, p_parent);

      p_parent = parent(p_nd);

    }

}