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 pat_trie_. 39 */ 40 41 #ifdef _GLIBCXX_DEBUG 42 43 PB_DS_CLASS_T_DEC 44 void 45 PB_DS_CLASS_C_DEC:: 46 assert_valid() const 47 { 48 if (m_p_head->m_p_parent != NULL) 49 m_p_head->m_p_parent->assert_valid(this); 50 assert_iterators(); 51 assert_reverse_iterators(); 52 if (m_p_head->m_p_parent == NULL) 53 { 54 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_min == m_p_head); 55 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_max == m_p_head); 56 _GLIBCXX_DEBUG_ASSERT(empty()); 57 return; 58 } 59 60 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_min->m_type == pat_trie_leaf_node_type); 61 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_max->m_type == pat_trie_leaf_node_type); 62 _GLIBCXX_DEBUG_ASSERT(!empty()); 63 } 64 65 PB_DS_CLASS_T_DEC 66 void 67 PB_DS_CLASS_C_DEC:: 68 assert_iterators() const 69 { 70 size_type calc_size = 0; 71 for (const_iterator it = begin(); it != end(); ++it) 72 { 73 ++calc_size; 74 debug_base::check_key_exists(PB_DS_V2F(*it)); 75 _GLIBCXX_DEBUG_ASSERT(lower_bound(PB_DS_V2F(*it)) == it); 76 _GLIBCXX_DEBUG_ASSERT(--upper_bound(PB_DS_V2F(*it)) == it); 77 } 78 _GLIBCXX_DEBUG_ASSERT(calc_size == m_size); 79 } 80 81 PB_DS_CLASS_T_DEC 82 void 83 PB_DS_CLASS_C_DEC:: 84 assert_reverse_iterators() const 85 { 86 size_type calc_size = 0; 87 for (const_reverse_iterator it = rbegin(); it != rend(); ++it) 88 { 89 ++calc_size; 90 const_node_pointer p_nd = 91 const_cast<PB_DS_CLASS_C_DEC* >(this)->find_imp(PB_DS_V2F(*it)); 92 _GLIBCXX_DEBUG_ASSERT(p_nd == it.m_p_nd); 93 } 94 _GLIBCXX_DEBUG_ASSERT(calc_size == m_size); 95 } 96 97 PB_DS_CLASS_T_DEC 98 typename PB_DS_CLASS_C_DEC::size_type 99 PB_DS_CLASS_C_DEC:: 100 recursive_count_leafs(const_node_pointer p_nd) 101 { 102 if (p_nd == NULL) 103 return (0); 104 if (p_nd->m_type == pat_trie_leaf_node_type) 105 return (1); 106 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == pat_trie_internal_node_type); 107 size_type ret = 0; 108 for (typename internal_node::const_iterator it = 109 static_cast<const_internal_node_pointer>(p_nd)->begin(); 110 it != static_cast<const_internal_node_pointer>(p_nd)->end(); 111 ++it) 112 ret += recursive_count_leafs(*it); 113 return ret; 114 } 115 116 #endif 117 118