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 left_child_next_sibling_heap_/debug_fn_imps.hpp 38 * Contains an implementation class for left_child_next_sibling_heap_. 39 */ 40 41#ifdef PB_DS_CLASS_C_DEC 42 43#ifdef _GLIBCXX_DEBUG 44 45PB_DS_CLASS_T_DEC 46void 47PB_DS_CLASS_C_DEC:: 48assert_valid(const char* __file, int __line) const 49{ 50 PB_DS_DEBUG_VERIFY(m_p_root == 0 || m_p_root->m_p_prev_or_parent == 0); 51 52 if (m_p_root != 0) 53 assert_node_consistent(m_p_root, Single_Link_Roots, __file, __line); 54 assert_size(__file, __line); 55 assert_iterators(__file, __line); 56} 57 58PB_DS_CLASS_T_DEC 59void 60PB_DS_CLASS_C_DEC:: 61assert_node_consistent(node_const_pointer p_nd, bool single_link, 62 const char* __file, int __line) const 63{ 64 if (p_nd == 0) 65 return; 66 67 assert_node_consistent(p_nd->m_p_l_child, false, __file, __line); 68 assert_node_consistent(p_nd->m_p_next_sibling, single_link, __file, __line); 69 70 if (single_link) 71 PB_DS_DEBUG_VERIFY(p_nd->m_p_prev_or_parent == 0); 72 else if (p_nd->m_p_next_sibling != 0) 73 PB_DS_DEBUG_VERIFY(p_nd->m_p_next_sibling->m_p_prev_or_parent == p_nd); 74 75 if (p_nd->m_p_l_child == 0) 76 return; 77 78 node_const_pointer p_child = p_nd->m_p_l_child; 79 while (p_child != 0) 80 { 81 node_const_pointer p_next_child = p_child->m_p_next_sibling; 82 PB_DS_DEBUG_VERIFY(!Cmp_Fn::operator()(p_nd->m_value, p_child->m_value)); 83 p_child = p_next_child; 84 } 85 PB_DS_DEBUG_VERIFY(p_nd->m_p_l_child->m_p_prev_or_parent == p_nd); 86} 87 88PB_DS_CLASS_T_DEC 89void 90PB_DS_CLASS_C_DEC:: 91assert_iterators(const char* __file, int __line) const 92{ 93 PB_DS_DEBUG_VERIFY(std::distance(begin(), end()) == size()); 94} 95 96PB_DS_CLASS_T_DEC 97void 98PB_DS_CLASS_C_DEC:: 99assert_size(const char* __file, int __line) const 100{ 101 PB_DS_DEBUG_VERIFY(size_from_node(m_p_root) == m_size); 102} 103 104PB_DS_CLASS_T_DEC 105typename PB_DS_CLASS_C_DEC::size_type 106PB_DS_CLASS_C_DEC:: 107size_under_node(node_const_pointer p_nd) 108{ return 1 + size_from_node(p_nd->m_p_l_child); } 109 110PB_DS_CLASS_T_DEC 111typename PB_DS_CLASS_C_DEC::size_type 112PB_DS_CLASS_C_DEC:: 113size_from_node(node_const_pointer p_nd) 114{ 115 size_type ret = 0; 116 while (p_nd != 0) 117 { 118 ret += 1 + size_from_node(p_nd->m_p_l_child); 119 p_nd = p_nd->m_p_next_sibling; 120 } 121 return ret; 122} 123 124PB_DS_CLASS_T_DEC 125typename PB_DS_CLASS_C_DEC::size_type 126PB_DS_CLASS_C_DEC:: 127degree(node_const_pointer p_nd) 128{ 129 size_type ret = 0; 130 node_const_pointer p_child = p_nd->m_p_l_child; 131 while (p_child != 0) 132 { 133 ++ret; 134 p_child = p_child->m_p_next_sibling; 135 } 136 return ret; 137} 138 139#endif 140#endif 141