3 // Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010
4 // Free Software Foundation, Inc.
6 // This file is part of the GNU ISO C++ Library. This library is free
7 // software; you can redistribute it and/or modify it under the terms
8 // of the GNU General Public License as published by the Free Software
9 // Foundation; either version 3, or (at your option) any later
12 // This library is distributed in the hope that it will be useful, but
13 // WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 // General Public License for more details.
17 // Under Section 7 of GPL version 3, you are granted additional
18 // permissions described in the GCC Runtime Library Exception, version
19 // 3.1, as published by the Free Software Foundation.
21 // You should have received a copy of the GNU General Public License and
22 // a copy of the GCC Runtime Library Exception along with this program;
23 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
24 // <http://www.gnu.org/licenses/>.
26 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
28 // Permission to use, copy, modify, sell, and distribute this software
29 // is hereby granted without fee, provided that the above copyright
30 // notice appears in all copies, and that both that copyright notice
31 // and this permission notice appear in supporting documentation. None
32 // of the above authors, nor IBM Haifa Research Laboratories, make any
33 // representation about the suitability of this software for any
34 // purpose. It is provided "as is" without express or implied
38 * @file debug_fn_imps.hpp
39 * Contains an implementation class for a base of binomial heaps.
47 assert_valid(bool strictly_binomial) const
49 base_type::assert_valid();
50 assert_node_consistent(base_type::m_p_root, strictly_binomial, true);
61 _GLIBCXX_DEBUG_ASSERT(base_type::parent(m_p_max) == 0);
62 for (const_iterator it = base_type::begin(); it != base_type::end(); ++it)
63 _GLIBCXX_DEBUG_ASSERT(!Cmp_Fn::operator()(m_p_max->m_value,
70 assert_node_consistent(const_node_pointer p_nd, bool strictly_binomial,
71 bool increasing) const
73 _GLIBCXX_DEBUG_ASSERT(increasing || strictly_binomial);
74 base_type::assert_node_consistent(p_nd, false);
77 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == base_type::degree(p_nd));
78 _GLIBCXX_DEBUG_ASSERT(base_type::size_under_node(p_nd) ==
79 static_cast<size_type>(1 << p_nd->m_metadata));
80 assert_node_consistent(p_nd->m_p_next_sibling, strictly_binomial, increasing);
81 assert_node_consistent(p_nd->m_p_l_child, true, false);
82 if (p_nd->m_p_next_sibling != 0)
86 if (strictly_binomial)
87 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata
88 < p_nd->m_p_next_sibling->m_metadata);
90 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata
91 <= p_nd->m_p_next_sibling->m_metadata);
94 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata
95 > p_nd->m_p_next_sibling->m_metadata);