1169691Skan// -*- C++ -*- 2169691Skan 3169691Skan// Copyright (C) 2005, 2006 Free Software Foundation, Inc. 4169691Skan// 5169691Skan// This file is part of the GNU ISO C++ Library. This library is free 6169691Skan// software; you can redistribute it and/or modify it under the terms 7169691Skan// of the GNU General Public License as published by the Free Software 8169691Skan// Foundation; either version 2, or (at your option) any later 9169691Skan// version. 10169691Skan 11169691Skan// This library is distributed in the hope that it will be useful, but 12169691Skan// WITHOUT ANY WARRANTY; without even the implied warranty of 13169691Skan// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 14169691Skan// General Public License for more details. 15169691Skan 16169691Skan// You should have received a copy of the GNU General Public License 17169691Skan// along with this library; see the file COPYING. If not, write to 18169691Skan// the Free Software Foundation, 59 Temple Place - Suite 330, Boston, 19169691Skan// MA 02111-1307, USA. 20169691Skan 21169691Skan// As a special exception, you may use this file as part of a free 22169691Skan// software library without restriction. Specifically, if other files 23169691Skan// instantiate templates or use macros or inline functions from this 24169691Skan// file, or you compile this file and link it with other files to 25169691Skan// produce an executable, this file does not by itself cause the 26169691Skan// resulting executable to be covered by the GNU General Public 27169691Skan// License. This exception does not however invalidate any other 28169691Skan// reasons why the executable file might be covered by the GNU General 29169691Skan// Public License. 30169691Skan 31169691Skan// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 32169691Skan 33169691Skan// Permission to use, copy, modify, sell, and distribute this software 34169691Skan// is hereby granted without fee, provided that the above copyright 35169691Skan// notice appears in all copies, and that both that copyright notice 36169691Skan// and this permission notice appear in supporting documentation. None 37169691Skan// of the above authors, nor IBM Haifa Research Laboratories, make any 38169691Skan// representation about the suitability of this software for any 39169691Skan// purpose. It is provided "as is" without express or implied 40169691Skan// warranty. 41169691Skan 42169691Skan/** 43169691Skan * @file debug_fn_imps.hpp 44169691Skan * Contains an implementation class for a base of binomial heaps. 45169691Skan */ 46169691Skan 47169691Skan#ifdef _GLIBCXX_DEBUG 48169691Skan 49169691SkanPB_DS_CLASS_T_DEC 50169691Skanvoid 51169691SkanPB_DS_CLASS_C_DEC:: 52169691Skanassert_valid(bool strictly_binomial) const 53169691Skan{ 54169691Skan base_type::assert_valid(); 55169691Skan assert_node_consistent(base_type::m_p_root, strictly_binomial, true); 56169691Skan assert_max(); 57169691Skan} 58169691Skan 59169691SkanPB_DS_CLASS_T_DEC 60169691Skanvoid 61169691SkanPB_DS_CLASS_C_DEC:: 62169691Skanassert_max() const 63169691Skan{ 64169691Skan if (m_p_max == NULL) 65169691Skan return; 66169691Skan _GLIBCXX_DEBUG_ASSERT(base_type::parent(m_p_max) == NULL); 67169691Skan for (const_iterator it = base_type::begin(); it != base_type::end(); ++it) 68169691Skan _GLIBCXX_DEBUG_ASSERT(!Cmp_Fn::operator()(m_p_max->m_value, it.m_p_nd->m_value)); 69169691Skan} 70169691Skan 71169691SkanPB_DS_CLASS_T_DEC 72169691Skanvoid 73169691SkanPB_DS_CLASS_C_DEC:: 74169691Skanassert_node_consistent(const_node_pointer p_nd, bool strictly_binomial, bool increasing) const 75169691Skan{ 76169691Skan _GLIBCXX_DEBUG_ASSERT(increasing || strictly_binomial); 77169691Skan base_type::assert_node_consistent(p_nd, false); 78169691Skan if (p_nd == NULL) 79169691Skan return; 80169691Skan _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == base_type::degree(p_nd)); 81169691Skan _GLIBCXX_DEBUG_ASSERT(base_type::size_under_node(p_nd) == 82169691Skan static_cast<size_type>(1 << p_nd->m_metadata)); 83169691Skan assert_node_consistent(p_nd->m_p_next_sibling, strictly_binomial, increasing); 84169691Skan assert_node_consistent(p_nd->m_p_l_child, true, false); 85169691Skan if (p_nd->m_p_next_sibling != NULL) 86169691Skan if (increasing) 87169691Skan { 88169691Skan if (strictly_binomial) 89169691Skan _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata < p_nd->m_p_next_sibling->m_metadata); 90169691Skan else 91169691Skan _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata <= p_nd->m_p_next_sibling->m_metadata); 92169691Skan } 93169691Skan else 94169691Skan _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata > p_nd->m_p_next_sibling->m_metadata); 95169691Skan} 96169691Skan 97169691Skan#endif 98