Subversion Repositories openrisc

// -*- C++ -*-

// Copyright (C) 2005, 2006, 2007, 2008, 2009 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 debug_fn_imps.hpp

 * Contains an implementation class for a base of binomial heaps.

 */

#ifdef _GLIBCXX_DEBUG

PB_DS_CLASS_T_DEC

void

PB_DS_CLASS_C_DEC::

assert_valid(bool strictly_binomial) const

{

  base_type::assert_valid();

  assert_node_consistent(base_type::m_p_root, strictly_binomial, true);

  assert_max();

}

PB_DS_CLASS_T_DEC

void

PB_DS_CLASS_C_DEC::

assert_max() const

{

  if (m_p_max == NULL)

    return;

  _GLIBCXX_DEBUG_ASSERT(base_type::parent(m_p_max) == NULL);

  for (const_iterator it = base_type::begin(); it != base_type::end(); ++it)

    _GLIBCXX_DEBUG_ASSERT(!Cmp_Fn::operator()(m_p_max->m_value,

                                              it.m_p_nd->m_value));

}

PB_DS_CLASS_T_DEC

void

PB_DS_CLASS_C_DEC::

assert_node_consistent(const_node_pointer p_nd, bool strictly_binomial,

                       bool increasing) const

{

  _GLIBCXX_DEBUG_ASSERT(increasing || strictly_binomial);

  base_type::assert_node_consistent(p_nd, false);

  if (p_nd == NULL)

    return;

  _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == base_type::degree(p_nd));

  _GLIBCXX_DEBUG_ASSERT(base_type::size_under_node(p_nd) ==

                   static_cast<size_type>(1 << p_nd->m_metadata));

  assert_node_consistent(p_nd->m_p_next_sibling, strictly_binomial, increasing);

  assert_node_consistent(p_nd->m_p_l_child, true, false);

  if (p_nd->m_p_next_sibling != NULL)

    {

      if (increasing)

        {

          if (strictly_binomial)

            _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata

                                  < p_nd->m_p_next_sibling->m_metadata);

          else

            _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata

                                  <= p_nd->m_p_next_sibling->m_metadata);

        }

      else

        _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata

                              > p_nd->m_p_next_sibling->m_metadata);

    }

}

#endif