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 trace_fn_imps.hpp 38 * Contains an implementation class for pat_trie_. 39 */ 40 41 #ifdef PB_DS_PAT_TRIE_TRACE_ 42 43 PB_DS_CLASS_T_DEC 44 void 45 PB_DS_CLASS_C_DEC:: 46 trace() const 47 { 48 std::cerr << std::endl; 49 if (m_p_head->m_p_parent == NULL) 50 return; 51 trace_node(m_p_head->m_p_parent, 0); 52 std::cerr << std::endl; 53 } 54 55 PB_DS_CLASS_T_DEC 56 void 57 PB_DS_CLASS_C_DEC:: 58 trace_node(const_node_pointer p_nd, size_type level) 59 { 60 for (size_type i = 0; i < level; ++i) 61 std::cerr << ' '; 62 std::cerr << p_nd << " "; 63 std::cerr << ((p_nd->m_type == pat_trie_leaf_node_type) ? "l " : "i "); 64 65 trace_node_metadata(p_nd, type_to_type<typename node::metadata_type>()); 66 typename e_access_traits::const_iterator el_it = pref_begin(p_nd); 67 while (el_it != pref_end(p_nd)) 68 { 69 std::cerr <<* el_it; 70 ++el_it; 71 } 72 73 if (p_nd->m_type == pat_trie_leaf_node_type) 74 { 75 std::cerr << std::endl; 76 return; 77 } 78 79 const_internal_node_pointer p_internal = 80 static_cast<const_internal_node_pointer>(p_nd); 81 82 std::cerr << " " << 83 static_cast<unsigned long>(p_internal->get_e_ind()) << std::endl; 84 85 const size_type num_children = std::distance(p_internal->begin(), 86 p_internal->end()); 87 88 for (size_type child_i = 0; child_i < num_children; ++child_i) 89 { 90 typename internal_node::const_iterator child_it = 91 p_internal->begin(); 92 std::advance(child_it, num_children - child_i - 1); 93 trace_node(*child_it, level + 1); 94 } 95 } 96 97 PB_DS_CLASS_T_DEC 98 template<typename Metadata_> 99 void 100 PB_DS_CLASS_C_DEC:: 101 trace_node_metadata(const_node_pointer p_nd, type_to_type<Metadata_>) 102 { 103 std::cerr << "(" << static_cast<unsigned long>(p_nd->get_metadata()) << ") "; 104 } 105 106 PB_DS_CLASS_T_DEC 107 void 108 PB_DS_CLASS_C_DEC:: 109 trace_node_metadata(const_node_pointer, type_to_type<null_node_metadata>) 110 { } 111 112 #endif 113 114