libstdc++
|
00001 // -*- C++ -*- 00002 00003 // Copyright (C) 2005, 2006, 2009, 2010 Free Software Foundation, Inc. 00004 // 00005 // This file is part of the GNU ISO C++ Library. This library is free 00006 // software; you can redistribute it and/or modify it under the terms 00007 // of the GNU General Public License as published by the Free Software 00008 // Foundation; either version 3, or (at your option) any later 00009 // version. 00010 00011 // This library is distributed in the hope that it will be useful, but 00012 // WITHOUT ANY WARRANTY; without even the implied warranty of 00013 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00014 // General Public License for more details. 00015 00016 // Under Section 7 of GPL version 3, you are granted additional 00017 // permissions described in the GCC Runtime Library Exception, version 00018 // 3.1, as published by the Free Software Foundation. 00019 00020 // You should have received a copy of the GNU General Public License and 00021 // a copy of the GCC Runtime Library Exception along with this program; 00022 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see 00023 // <http://www.gnu.org/licenses/>. 00024 00025 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 00026 00027 // Permission to use, copy, modify, sell, and distribute this software 00028 // is hereby granted without fee, provided that the above copyright 00029 // notice appears in all copies, and that both that copyright notice 00030 // and this permission notice appear in supporting documentation. None 00031 // of the above authors, nor IBM Haifa Research Laboratories, make any 00032 // representation about the suitability of this software for any 00033 // purpose. It is provided "as is" without express or implied 00034 // warranty. 00035 00036 /** 00037 * @file left_child_next_sibling_heap_/trace_fn_imps.hpp 00038 * Contains an implementation class for left_child_next_sibling_heap_. 00039 */ 00040 00041 #ifdef PB_DS_LC_NS_HEAP_TRACE_ 00042 00043 PB_DS_CLASS_T_DEC 00044 void 00045 PB_DS_CLASS_C_DEC:: 00046 trace() const 00047 { 00048 std::cerr << std::endl; 00049 trace_node(m_p_root, 0); 00050 std::cerr << std::endl; 00051 } 00052 00053 PB_DS_CLASS_T_DEC 00054 void 00055 PB_DS_CLASS_C_DEC:: 00056 trace_node(node_const_pointer p_nd, size_type level) 00057 { 00058 while (p_nd != 0) 00059 { 00060 for (size_type i = 0; i < level; ++i) 00061 std::cerr << ' '; 00062 00063 std::cerr << p_nd << 00064 " prev = " << p_nd->m_p_prev_or_parent << 00065 " next " << p_nd->m_p_next_sibling << 00066 " left = " << p_nd->m_p_l_child << " "; 00067 00068 trace_node_metadata(p_nd, type_to_type<node_metadata>()); 00069 std::cerr << p_nd->m_value << std::endl; 00070 trace_node(p_nd->m_p_l_child, level + 1); 00071 p_nd = p_nd->m_p_next_sibling; 00072 } 00073 } 00074 00075 PB_DS_CLASS_T_DEC 00076 template<typename Metadata_> 00077 void 00078 PB_DS_CLASS_C_DEC:: 00079 trace_node_metadata(node_const_pointer p_nd, type_to_type<Metadata_>) 00080 { 00081 std::cerr << "(" << p_nd->m_metadata << ") "; 00082 } 00083 00084 PB_DS_CLASS_T_DEC 00085 void 00086 PB_DS_CLASS_C_DEC:: 00087 trace_node_metadata(node_const_pointer, type_to_type<null_type>) 00088 { } 00089 00090 #endif // #ifdef PB_DS_LC_NS_HEAP_TRACE_