3 // Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc.
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
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.
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.
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/>.
25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
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
37 * @file trace_fn_imps.hpp
38 * Contains an implementation class for pat_trie_.
41 #ifdef PB_DS_PAT_TRIE_TRACE_
48 std::cerr
<< std::endl
;
49 if (m_p_head
->m_p_parent
== 0)
51 trace_node(m_p_head
->m_p_parent
, 0);
52 std::cerr
<< std::endl
;
58 trace_node(const_node_pointer p_nd
, size_type level
)
60 for (size_type i
= 0; i
< level
; ++i
)
62 std::cerr
<< p_nd
<< " ";
63 std::cerr
<< ((p_nd
->m_type
== pat_trie_leaf_node_type
) ? "l " : "i ");
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
))
73 if (p_nd
->m_type
== pat_trie_leaf_node_type
)
75 std::cerr
<< std::endl
;
79 const_internal_node_pointer p_internal
=
80 static_cast<const_internal_node_pointer
>(p_nd
);
83 static_cast<unsigned long>(p_internal
->get_e_ind()) << std::endl
;
85 const size_type num_children
= std::distance(p_internal
->begin(),
88 for (size_type child_i
= 0; child_i
< num_children
; ++child_i
)
90 typename
internal_node::const_iterator child_it
=
92 std::advance(child_it
, num_children
- child_i
- 1);
93 trace_node(*child_it
, level
+ 1);
98 template<typename Metadata_
>
101 trace_node_metadata(const_node_pointer p_nd
, type_to_type
<Metadata_
>)
103 std::cerr
<< "(" << static_cast<unsigned long>(p_nd
->get_metadata()) << ") ";
109 trace_node_metadata(const_node_pointer
, type_to_type
<null_node_metadata
>)