Where Online Learning is simpler!
The C and C++ Include Header Files
/usr/include/c++/13/ext/pb_ds/detail/thin_heap_/debug_fn_imps.hpp
$ cat -n /usr/include/c++/13/ext/pb_ds/detail/thin_heap_/debug_fn_imps.hpp 1 // -*- C++ -*- 2 3 // Copyright (C) 2005-2023 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 //
. 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 thin_heap_/debug_fn_imps.hpp 38 * Contains an implementation for thin_heap_. 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:: 48 assert_valid(const char* __file, int __line) const 49 { 50 base_type::assert_valid(__file, __line); 51 assert_node_consistent(base_type::m_p_root, true, __file, __line); 52 assert_max(__file, __line); 53 assert_aux_null(__file, __line); 54 } 55 56 PB_DS_CLASS_T_DEC 57 void 58 PB_DS_CLASS_C_DEC:: 59 assert_aux_null(const char* __file, int __line) const 60 { 61 for (size_type i = 0; i < max_rank; ++i) 62 PB_DS_DEBUG_VERIFY(m_a_aux[i] == 0); 63 } 64 65 PB_DS_CLASS_T_DEC 66 void 67 PB_DS_CLASS_C_DEC:: 68 assert_max(const char* __file, int __line) const 69 { 70 if (m_p_max == 0) 71 { 72 PB_DS_DEBUG_VERIFY(base_type::empty()); 73 return; 74 } 75 76 PB_DS_DEBUG_VERIFY(!base_type::empty()); 77 PB_DS_DEBUG_VERIFY(base_type::parent(m_p_max) == 0); 78 PB_DS_DEBUG_VERIFY(m_p_max->m_p_prev_or_parent == 0); 79 for (const_iterator it = base_type::begin(); it != base_type::end(); ++it) 80 PB_DS_DEBUG_VERIFY(!Cmp_Fn::operator()(m_p_max->m_value, it.m_p_nd->m_value)); 81 } 82 83 PB_DS_CLASS_T_DEC 84 void 85 PB_DS_CLASS_C_DEC:: 86 assert_node_consistent(node_const_pointer p_nd, bool root, 87 const char* __file, int __line) const 88 { 89 base_type::assert_node_consistent(p_nd, root, __file, __line); 90 if (p_nd == 0) 91 return; 92 93 assert_node_consistent(p_nd->m_p_next_sibling, root, __file, __line); 94 assert_node_consistent(p_nd->m_p_l_child, false, __file, __line); 95 if (!root) 96 { 97 if (p_nd->m_metadata == 0) 98 PB_DS_DEBUG_VERIFY(p_nd->m_p_next_sibling == 0); 99 else 100 PB_DS_DEBUG_VERIFY(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata + 1); 101 } 102 103 if (p_nd->m_p_l_child != 0) 104 PB_DS_DEBUG_VERIFY(p_nd->m_p_l_child->m_metadata + 1 == base_type::degree(p_nd)); 105 106 const bool unmarked_valid = 107 (p_nd->m_p_l_child == 0 && p_nd->m_metadata == 0) 108 || (p_nd->m_p_l_child != 0 109 && p_nd->m_metadata == p_nd->m_p_l_child->m_metadata + 1); 110 111 const bool marked_valid = 112 (p_nd->m_p_l_child == 0 && p_nd->m_metadata == 1) 113 || (p_nd->m_p_l_child != 0 114 && p_nd->m_metadata == p_nd->m_p_l_child->m_metadata + 2); 115 116 PB_DS_DEBUG_VERIFY(unmarked_valid || marked_valid); 117 if (root) 118 PB_DS_DEBUG_VERIFY(unmarked_valid); 119 } 120 121 #endif 122 #endif
Contact us
|
About us
|
Term of use
|
Copyright © 2000-2025 MyWebUniversity.com ™