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 left_child_next_sibling_heap_. 39 */ 40 41 #ifdef PB_DS_LC_NS_HEAP_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 50 trace_node(m_p_root, 0); 51 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 while (p_nd != NULL) 61 { 62 for (size_type i = 0; i < level; ++i) 63 std::cerr << ' '; 64 65 std::cerr << p_nd << 66 " prev = " << p_nd->m_p_prev_or_parent << 67 " next " << p_nd->m_p_next_sibling << 68 " left = " << p_nd->m_p_l_child << " "; 69 70 trace_node_metadata(p_nd, type_to_type<node_metadata>()); 71 72 std::cerr << p_nd->m_value << std::endl; 73 74 trace_node(p_nd->m_p_l_child, level + 1); 75 76 p_nd = p_nd->m_p_next_sibling; 77 } 78 } 79 80 PB_DS_CLASS_T_DEC 81 template<typename Metadata_> 82 void 83 PB_DS_CLASS_C_DEC:: 84 trace_node_metadata(const_node_pointer p_nd, type_to_type<Metadata_>) 85 { 86 std::cerr << "(" << p_nd->m_metadata << ") "; 87 } 88 89 PB_DS_CLASS_T_DEC 90 void 91 PB_DS_CLASS_C_DEC:: 92 trace_node_metadata(const_node_pointer, type_to_type<null_left_child_next_sibling_heap_node_metadata>) 93 { } 94 95 #endif // #ifdef PB_DS_LC_NS_HEAP_TRACE_ 96
