libstdc++
|
00001 // -*- C++ -*- 00002 00003 // Copyright (C) 2005-2015 Free Software Foundation, Inc. 00004 // 00005 // This file is part of the GNU ISO C++ Library. This library is free 00006 // software; you can redistribute it and/or modify it under the terms 00007 // of the GNU General Public License as published by the Free Software 00008 // Foundation; either version 3, or (at your option) any later 00009 // version. 00010 00011 // This library is distributed in the hope that it will be useful, but 00012 // WITHOUT ANY WARRANTY; without even the implied warranty of 00013 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00014 // General Public License for more details. 00015 00016 // Under Section 7 of GPL version 3, you are granted additional 00017 // permissions described in the GCC Runtime Library Exception, version 00018 // 3.1, as published by the Free Software Foundation. 00019 00020 // You should have received a copy of the GNU General Public License and 00021 // a copy of the GCC Runtime Library Exception along with this program; 00022 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see 00023 // <http://www.gnu.org/licenses/>. 00024 00025 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 00026 00027 // Permission to use, copy, modify, sell, and distribute this software 00028 // is hereby granted without fee, provided that the above copyright 00029 // notice appears in all copies, and that both that copyright notice 00030 // and this permission notice appear in supporting documentation. None 00031 // of the above authors, nor IBM Haifa Research Laboratories, make any 00032 // representation about the suitability of this software for any 00033 // purpose. It is provided "as is" without express or implied 00034 // warranty. 00035 00036 /** 00037 * @file binomial_heap_base_/debug_fn_imps.hpp 00038 * Contains an implementation class for a base of binomial heaps. 00039 */ 00040 00041 #ifdef _GLIBCXX_DEBUG 00042 00043 PB_DS_CLASS_T_DEC 00044 void 00045 PB_DS_CLASS_C_DEC:: 00046 assert_valid(bool strictly_binomial, const char* __file, int __line) const 00047 { 00048 base_type::assert_valid(__file, __line); 00049 assert_node_consistent(base_type::m_p_root, strictly_binomial, true, 00050 __file, __line); 00051 assert_max(__file, __line); 00052 } 00053 00054 PB_DS_CLASS_T_DEC 00055 void 00056 PB_DS_CLASS_C_DEC:: 00057 assert_max(const char* __file, int __line) const 00058 { 00059 if (m_p_max == 0) 00060 return; 00061 PB_DS_DEBUG_VERIFY(base_type::parent(m_p_max) == 0); 00062 for (const_iterator it = base_type::begin(); it != base_type::end(); ++it) 00063 PB_DS_DEBUG_VERIFY(!Cmp_Fn::operator()(m_p_max->m_value, 00064 it.m_p_nd->m_value)); 00065 } 00066 00067 PB_DS_CLASS_T_DEC 00068 void 00069 PB_DS_CLASS_C_DEC:: 00070 assert_node_consistent(node_const_pointer p_nd, bool strictly_binomial, 00071 bool increasing, const char* __file, int __line) const 00072 { 00073 PB_DS_DEBUG_VERIFY(increasing || strictly_binomial); 00074 base_type::assert_node_consistent(p_nd, false, __file, __line); 00075 if (p_nd == 0) 00076 return; 00077 PB_DS_DEBUG_VERIFY(p_nd->m_metadata == base_type::degree(p_nd)); 00078 PB_DS_DEBUG_VERIFY(base_type::size_under_node(p_nd) == 00079 static_cast<size_type>(1 << p_nd->m_metadata)); 00080 assert_node_consistent(p_nd->m_p_next_sibling, strictly_binomial, increasing, 00081 __file, __line); 00082 assert_node_consistent(p_nd->m_p_l_child, true, false, __file, __line); 00083 if (p_nd->m_p_next_sibling != 0) 00084 { 00085 if (increasing) 00086 { 00087 if (strictly_binomial) 00088 PB_DS_DEBUG_VERIFY(p_nd->m_metadata 00089 < p_nd->m_p_next_sibling->m_metadata); 00090 else 00091 PB_DS_DEBUG_VERIFY(p_nd->m_metadata 00092 <= p_nd->m_p_next_sibling->m_metadata); 00093 } 00094 else 00095 PB_DS_DEBUG_VERIFY(p_nd->m_metadata 00096 > p_nd->m_p_next_sibling->m_metadata); 00097 } 00098 } 00099 00100 #endif