3 // Copyright (C) 2005, 2006 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 2, 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 // You should have received a copy of the GNU General Public License
17 // along with this library; see the file COPYING. If not, write to
18 // the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
19 // MA 02111-1307, USA.
21 // As a special exception, you may use this file as part of a free
22 // software library without restriction. Specifically, if other files
23 // instantiate templates or use macros or inline functions from this
24 // file, or you compile this file and link it with other files to
25 // produce an executable, this file does not by itself cause the
26 // resulting executable to be covered by the GNU General Public
27 // License. This exception does not however invalidate any other
28 // reasons why the executable file might be covered by the GNU General
31 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
33 // Permission to use, copy, modify, sell, and distribute this software
34 // is hereby granted without fee, provided that the above copyright
35 // notice appears in all copies, and that both that copyright notice
36 // and this permission notice appear in supporting documentation. None
37 // of the above authors, nor IBM Haifa Research Laboratories, make any
38 // representation about the suitability of this software for any
39 // purpose. It is provided "as is" without express or implied
43 * @file trace_fn_imps.hpp
44 * Contains an implementation class for pat_trie_.
47 #ifdef PB_DS_PAT_TRIE_TRACE_
54 std::cerr
<< std::endl
;
55 if (m_p_head
->m_p_parent
== NULL
)
57 trace_node(m_p_head
->m_p_parent
, 0);
58 std::cerr
<< std::endl
;
64 trace_node(const_node_pointer p_nd
, size_type level
)
66 for (size_type i
= 0; i
< level
; ++i
)
68 std::cerr
<< p_nd
<< " ";
69 std::cerr
<< ((p_nd
->m_type
== pat_trie_leaf_node_type
) ? "l " : "i ");
71 trace_node_metadata(p_nd
, type_to_type
<typename
node::metadata_type
>());
72 typename
e_access_traits::const_iterator el_it
= pref_begin(p_nd
);
73 while (el_it
!= pref_end(p_nd
))
79 if (p_nd
->m_type
== pat_trie_leaf_node_type
)
81 std::cerr
<< std::endl
;
85 const_internal_node_pointer p_internal
=
86 static_cast<const_internal_node_pointer
>(p_nd
);
89 static_cast<unsigned long>(p_internal
->get_e_ind()) << std::endl
;
91 const size_type num_children
= std::distance(p_internal
->begin(),
94 for (size_type child_i
= 0; child_i
< num_children
; ++child_i
)
96 typename
internal_node::const_iterator child_it
=
98 std::advance(child_it
, num_children
- child_i
- 1);
99 trace_node(*child_it
, level
+ 1);
104 template<typename Metadata_
>
107 trace_node_metadata(const_node_pointer p_nd
, type_to_type
<Metadata_
>)
109 std::cerr
<< "(" << static_cast<unsigned long>(p_nd
->get_metadata()) << ") ";
115 trace_node_metadata(const_node_pointer
, type_to_type
<null_node_metadata
>)