1// -*- C++ -*-
2
3// Copyright (C) 2005, 2006, 2007, 2008, 2009 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 debug_fn_imps.hpp
38 * Contains an implementation class for a base of binomial heaps.
39 */
40
41#ifdef _GLIBCXX_DEBUG
42
43PB_DS_CLASS_T_DEC
44void
45PB_DS_CLASS_C_DEC::
46assert_valid(bool strictly_binomial) const
47{
48  base_type::assert_valid();
49  assert_node_consistent(base_type::m_p_root, strictly_binomial, true);
50  assert_max();
51}
52
53PB_DS_CLASS_T_DEC
54void
55PB_DS_CLASS_C_DEC::
56assert_max() const
57{
58  if (m_p_max == NULL)
59    return;
60  _GLIBCXX_DEBUG_ASSERT(base_type::parent(m_p_max) == NULL);
61  for (const_iterator it = base_type::begin(); it != base_type::end(); ++it)
62    _GLIBCXX_DEBUG_ASSERT(!Cmp_Fn::operator()(m_p_max->m_value,
63					      it.m_p_nd->m_value));
64}
65
66PB_DS_CLASS_T_DEC
67void
68PB_DS_CLASS_C_DEC::
69assert_node_consistent(const_node_pointer p_nd, bool strictly_binomial,
70		       bool increasing) const
71{
72  _GLIBCXX_DEBUG_ASSERT(increasing || strictly_binomial);
73  base_type::assert_node_consistent(p_nd, false);
74  if (p_nd == NULL)
75    return;
76  _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == base_type::degree(p_nd));
77  _GLIBCXX_DEBUG_ASSERT(base_type::size_under_node(p_nd) ==
78		   static_cast<size_type>(1 << p_nd->m_metadata));
79  assert_node_consistent(p_nd->m_p_next_sibling, strictly_binomial, increasing);
80  assert_node_consistent(p_nd->m_p_l_child, true, false);
81  if (p_nd->m_p_next_sibling != NULL)
82    {
83      if (increasing)
84	{
85	  if (strictly_binomial)
86	    _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata
87				  < p_nd->m_p_next_sibling->m_metadata);
88	  else
89	    _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata
90				  <= p_nd->m_p_next_sibling->m_metadata);
91	}
92      else
93	_GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata
94			      > p_nd->m_p_next_sibling->m_metadata);
95    }
96}
97
98#endif
99