1 // -*- C++ -*-
2
3 // Copyright (C) 2005-2022 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 binomial_heap_base_/debug_fn_imps.hpp
38 * Contains an implementation class for a base of binomial heaps.
39 */
40
41 #ifdef PB_DS_CLASS_C_DEC
42
43 #ifdef _GLIBCXX_DEBUG
44
45 PB_DS_CLASS_T_DEC
46 void
47 PB_DS_CLASS_C_DEC::
assert_valid(bool strictly_binomial,const char * __file,int __line) const48 assert_valid(bool strictly_binomial, const char* __file, int __line) const
49 {
50 base_type::assert_valid(__file, __line);
51 assert_node_consistent(base_type::m_p_root, strictly_binomial, true,
52 __file, __line);
53 assert_max(__file, __line);
54 }
55
56 PB_DS_CLASS_T_DEC
57 void
58 PB_DS_CLASS_C_DEC::
assert_max(const char * __file,int __line) const59 assert_max(const char* __file, int __line) const
60 {
61 if (m_p_max == 0)
62 return;
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,
66 it.m_p_nd->m_value));
67 }
68
69 PB_DS_CLASS_T_DEC
70 void
71 PB_DS_CLASS_C_DEC::
assert_node_consistent(node_const_pointer p_nd,bool strictly_binomial,bool increasing,const char * __file,int __line) const72 assert_node_consistent(node_const_pointer p_nd, bool strictly_binomial,
73 bool increasing, const char* __file, int __line) const
74 {
75 PB_DS_DEBUG_VERIFY(increasing || strictly_binomial);
76 base_type::assert_node_consistent(p_nd, false, __file, __line);
77 if (p_nd == 0)
78 return;
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,
83 __file, __line);
84 assert_node_consistent(p_nd->m_p_l_child, true, false, __file, __line);
85 if (p_nd->m_p_next_sibling != 0)
86 {
87 if (increasing)
88 {
89 if (strictly_binomial)
90 PB_DS_DEBUG_VERIFY(p_nd->m_metadata
91 < p_nd->m_p_next_sibling->m_metadata);
92 else
93 PB_DS_DEBUG_VERIFY(p_nd->m_metadata
94 <= p_nd->m_p_next_sibling->m_metadata);
95 }
96 else
97 PB_DS_DEBUG_VERIFY(p_nd->m_metadata
98 > p_nd->m_p_next_sibling->m_metadata);
99 }
100 }
101
102 #endif
103 #endif
104