1// -*- C++ -*- 2 3// Copyright (C) 2005, 2006 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 2, 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// You should have received a copy of the GNU General Public License 17// along with this library; see the file COPYING. If not, write to 18// the Free Software Foundation, 59 Temple Place - Suite 330, Boston, 19// MA 02111-1307, USA. 20 21// As a special exception, you may use this file as part of a free 22// software library without restriction. Specifically, if other files 23// instantiate templates or use macros or inline functions from this 24// file, or you compile this file and link it with other files to 25// produce an executable, this file does not by itself cause the 26// resulting executable to be covered by the GNU General Public 27// License. This exception does not however invalidate any other 28// reasons why the executable file might be covered by the GNU General 29// Public License. 30 31// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 32 33// Permission to use, copy, modify, sell, and distribute this software 34// is hereby granted without fee, provided that the above copyright 35// notice appears in all copies, and that both that copyright notice 36// and this permission notice appear in supporting documentation. None 37// of the above authors, nor IBM Haifa Research Laboratories, make any 38// representation about the suitability of this software for any 39// purpose. It is provided "as is" without express or implied 40// warranty. 41 42/** 43 * @file debug_fn_imps.hpp 44 * Contains an implementation class for a base of binomial heaps. 45 */ 46 47#ifdef _GLIBCXX_DEBUG 48 49PB_DS_CLASS_T_DEC 50void 51PB_DS_CLASS_C_DEC:: 52assert_valid(bool strictly_binomial) const 53{ 54 base_type::assert_valid(); 55 assert_node_consistent(base_type::m_p_root, strictly_binomial, true); 56 assert_max(); 57} 58 59PB_DS_CLASS_T_DEC 60void 61PB_DS_CLASS_C_DEC:: 62assert_max() const 63{ 64 if (m_p_max == NULL) 65 return; 66 _GLIBCXX_DEBUG_ASSERT(base_type::parent(m_p_max) == NULL); 67 for (const_iterator it = base_type::begin(); it != base_type::end(); ++it) 68 _GLIBCXX_DEBUG_ASSERT(!Cmp_Fn::operator()(m_p_max->m_value, it.m_p_nd->m_value)); 69} 70 71PB_DS_CLASS_T_DEC 72void 73PB_DS_CLASS_C_DEC:: 74assert_node_consistent(const_node_pointer p_nd, bool strictly_binomial, bool increasing) const 75{ 76 _GLIBCXX_DEBUG_ASSERT(increasing || strictly_binomial); 77 base_type::assert_node_consistent(p_nd, false); 78 if (p_nd == NULL) 79 return; 80 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == base_type::degree(p_nd)); 81 _GLIBCXX_DEBUG_ASSERT(base_type::size_under_node(p_nd) == 82 static_cast<size_type>(1 << p_nd->m_metadata)); 83 assert_node_consistent(p_nd->m_p_next_sibling, strictly_binomial, increasing); 84 assert_node_consistent(p_nd->m_p_l_child, true, false); 85 if (p_nd->m_p_next_sibling != NULL) 86 if (increasing) 87 { 88 if (strictly_binomial) 89 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata < p_nd->m_p_next_sibling->m_metadata); 90 else 91 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata <= p_nd->m_p_next_sibling->m_metadata); 92 } 93 else 94 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata > p_nd->m_p_next_sibling->m_metadata); 95} 96 97#endif 98