]>
Commit | Line | Data |
---|---|---|
4569a895 AT |
1 | // -*- C++ -*- |
2 | ||
3 | // Copyright (C) 2005, 2006 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 2, 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 | // 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. | |
20 | ||
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 | |
29 | // Public License. | |
30 | ||
31 | // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. | |
32 | ||
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 | |
40 | // warranty. | |
41 | ||
42 | /** | |
43 | * @file trace_fn_imps.hpp | |
44 | * Contains an implementation class for pat_trie_. | |
45 | */ | |
46 | ||
47 | #ifdef PB_DS_PAT_TRIE_TRACE_ | |
48 | ||
49 | PB_DS_CLASS_T_DEC | |
50 | void | |
51 | PB_DS_CLASS_C_DEC:: | |
52 | trace() const | |
53 | { | |
54 | std::cerr << std::endl; | |
55 | ||
56 | if (m_p_head->m_p_parent == NULL) | |
57 | return; | |
58 | ||
59 | trace_node(m_p_head->m_p_parent, 0); | |
60 | ||
61 | std::cerr << std::endl; | |
62 | } | |
63 | ||
64 | PB_DS_CLASS_T_DEC | |
65 | void | |
66 | PB_DS_CLASS_C_DEC:: | |
67 | trace_node(const_node_pointer p_nd, size_type level) | |
68 | { | |
69 | for (size_type i = 0; i < level; ++i) | |
70 | std::cerr << ' '; | |
71 | ||
72 | std::cerr << p_nd << " "; | |
73 | ||
74 | std::cerr << ((p_nd->m_type == pat_trie_leaf_node_type)? | |
75 | "l " : | |
76 | "i "); | |
77 | ||
78 | trace_node_metadata(p_nd, type_to_type<typename node::metadata_type>()); | |
79 | ||
80 | typename e_access_traits::const_iterator el_it = | |
81 | pref_begin(p_nd); | |
82 | ||
83 | while (el_it != pref_end(p_nd)) | |
84 | { | |
85 | std::cerr <<* el_it; | |
86 | ||
87 | ++el_it; | |
88 | } | |
89 | ||
90 | if (p_nd->m_type == pat_trie_leaf_node_type) | |
91 | { | |
92 | std::cerr << std::endl; | |
93 | ||
94 | return; | |
95 | } | |
96 | ||
97 | const_internal_node_pointer p_internal = | |
98 | static_cast<const_internal_node_pointer>(p_nd); | |
99 | ||
100 | std::cerr << " " << | |
101 | static_cast<unsigned long>(p_internal->get_e_ind()) << std::endl; | |
102 | ||
103 | const size_type num_children = std::distance( | |
104 | p_internal->begin(), | |
105 | p_internal->end()); | |
106 | ||
107 | for (size_type child_i = 0; child_i < num_children; ++child_i) | |
108 | { | |
109 | typename internal_node::const_iterator child_it = | |
110 | p_internal->begin(); | |
111 | std::advance(child_it, num_children - child_i - 1); | |
112 | ||
113 | trace_node(*child_it, level + 1); | |
114 | } | |
115 | } | |
116 | ||
117 | PB_DS_CLASS_T_DEC | |
118 | template<typename Metadata_> | |
119 | void | |
120 | PB_DS_CLASS_C_DEC:: | |
121 | trace_node_metadata(const_node_pointer p_nd, type_to_type<Metadata_>) | |
122 | { | |
123 | std::cerr << "(" << | |
124 | static_cast<unsigned long>(p_nd->get_metadata()) << ") "; | |
125 | } | |
126 | ||
127 | PB_DS_CLASS_T_DEC | |
128 | void | |
129 | PB_DS_CLASS_C_DEC:: | |
130 | trace_node_metadata(const_node_pointer, type_to_type<null_node_metadata>) | |
131 | { } | |
132 | ||
133 | #endif // #ifdef PB_DS_PAT_TRIE_TRACE_ | |
134 |