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