3 // Copyright (C) 2005-2021 Free Software Foundation, Inc.
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
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.
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.
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/>.
25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
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
37 * @file binomial_heap_base_/debug_fn_imps.hpp
38 * Contains an implementation class for a base of binomial heaps.
41 #ifdef PB_DS_CLASS_C_DEC
48 assert_valid(bool strictly_binomial, const char* __file, int __line) const
50 base_type::assert_valid(__file, __line);
51 assert_node_consistent(base_type::m_p_root, strictly_binomial, true,
53 assert_max(__file, __line);
59 assert_max(const char* __file, int __line) const
63 PB_DS_DEBUG_VERIFY(base_type::parent(m_p_max) == 0);
64 for (const_iterator it = base_type::begin(); it != base_type::end(); ++it)
65 PB_DS_DEBUG_VERIFY(!Cmp_Fn::operator()(m_p_max->m_value,
72 assert_node_consistent(node_const_pointer p_nd, bool strictly_binomial,
73 bool increasing, const char* __file, int __line) const
75 PB_DS_DEBUG_VERIFY(increasing || strictly_binomial);
76 base_type::assert_node_consistent(p_nd, false, __file, __line);
79 PB_DS_DEBUG_VERIFY(p_nd->m_metadata == base_type::degree(p_nd));
80 PB_DS_DEBUG_VERIFY(base_type::size_under_node(p_nd) ==
81 static_cast<size_type>(1 << p_nd->m_metadata));
82 assert_node_consistent(p_nd->m_p_next_sibling, strictly_binomial, increasing,
84 assert_node_consistent(p_nd->m_p_l_child, true, false, __file, __line);
85 if (p_nd->m_p_next_sibling != 0)
89 if (strictly_binomial)
90 PB_DS_DEBUG_VERIFY(p_nd->m_metadata
91 < p_nd->m_p_next_sibling->m_metadata);
93 PB_DS_DEBUG_VERIFY(p_nd->m_metadata
94 <= p_nd->m_p_next_sibling->m_metadata);
97 PB_DS_DEBUG_VERIFY(p_nd->m_metadata
98 > p_nd->m_p_next_sibling->m_metadata);