1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
|
// -*- C++ -*-
// Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the terms
// of the GNU General Public License as published by the Free Software
// Foundation; either version 3, or (at your option) any later
// version.
// This library is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// General Public License for more details.
// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.
// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
// <http://www.gnu.org/licenses/>.
// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
// Permission to use, copy, modify, sell, and distribute this software
// is hereby granted without fee, provided that the above copyright
// notice appears in all copies, and that both that copyright notice
// and this permission notice appear in supporting documentation. None
// of the above authors, nor IBM Haifa Research Laboratories, make any
// representation about the suitability of this software for any
// purpose. It is provided "as is" without express or implied
// warranty.
/**
* @file tree_trace_base.hpp
* Contains tree-related policies.
*/
#ifndef PB_DS_TREE_TRACE_BASE_HPP
#define PB_DS_TREE_TRACE_BASE_HPP
#ifdef PB_DS_TREE_TRACE
#include <ext/pb_ds/detail/basic_tree_policy/basic_tree_policy_base.hpp>
#include <ext/pb_ds/detail/basic_tree_policy/null_node_metadata.hpp>
namespace __gnu_pbds
{
namespace detail
{
#ifdef PB_DS_TREE_TRACE
#define PB_DS_CLASS_T_DEC \
template< \
class Const_Node_Iterator, \
class Node_Iterator, \
class Cmp_Fn, \
bool Node_Based, \
class Allocator>
#define PB_DS_CLASS_C_DEC \
tree_trace_base< \
Const_Node_Iterator, \
Node_Iterator, \
Cmp_Fn, \
Node_Based, \
Allocator>
#define PB_DS_BASE_C_DEC \
basic_tree_policy_base< \
Const_Node_Iterator, \
Node_Iterator, \
Allocator>
template<typename Const_Node_Iterator,
class Node_Iterator,
class Cmp_Fn,
bool Node_Based,
class Allocator>
class tree_trace_base : private PB_DS_BASE_C_DEC
{
public:
void
trace() const;
private:
typedef PB_DS_BASE_C_DEC base_type;
typedef Const_Node_Iterator const_node_iterator;
typedef typename Allocator::size_type size_type;
private:
void
trace_node(const_node_iterator nd_it, size_type level) const;
virtual bool
empty() const = 0;
virtual const_node_iterator
node_begin() const = 0;
virtual const_node_iterator
node_end() const = 0;
static void
print_node_pointer(Const_Node_Iterator nd_it, integral_constant<int,true>);
static void
print_node_pointer(Const_Node_Iterator nd_it, integral_constant<int,false>);
template<typename Metadata_>
static void
trace_it_metadata(Const_Node_Iterator nd_it, type_to_type<Metadata_>);
static void
trace_it_metadata(Const_Node_Iterator, type_to_type<null_node_metadata>);
};
PB_DS_CLASS_T_DEC
void
PB_DS_CLASS_C_DEC::
trace() const
{
if (empty())
return;
trace_node(node_begin(), 0);
}
PB_DS_CLASS_T_DEC
void
PB_DS_CLASS_C_DEC::
trace_node(const_node_iterator nd_it, size_type level) const
{
if (nd_it.get_r_child() != node_end())
trace_node(nd_it.get_r_child(), level + 1);
for (size_type i = 0; i < level; ++i)
std::cerr << ' ';
print_node_pointer(nd_it, integral_constant<int,Node_Based>());
std::cerr << base_type::extract_key(*(*nd_it));
typedef
type_to_type<
typename const_node_iterator::metadata_type>
m_type_ind_t;
trace_it_metadata(nd_it, m_type_ind_t());
std::cerr << std::endl;
if (nd_it.get_l_child() != node_end())
trace_node(nd_it.get_l_child(), level + 1);
}
PB_DS_CLASS_T_DEC
template<typename Metadata_>
void
PB_DS_CLASS_C_DEC::
trace_it_metadata(Const_Node_Iterator nd_it, type_to_type<Metadata_>)
{
std::cerr << " (" <<
static_cast<unsigned long>(nd_it.get_metadata()) << ") ";
}
PB_DS_CLASS_T_DEC
void
PB_DS_CLASS_C_DEC::
trace_it_metadata(Const_Node_Iterator, type_to_type<null_node_metadata>)
{ }
PB_DS_CLASS_T_DEC
void
PB_DS_CLASS_C_DEC::
print_node_pointer(Const_Node_Iterator nd_it, integral_constant<int,true>)
{
std::cerr << nd_it.m_p_nd << " ";
}
PB_DS_CLASS_T_DEC
void
PB_DS_CLASS_C_DEC::
print_node_pointer(Const_Node_Iterator nd_it, integral_constant<int,false>)
{
std::cerr <<* nd_it << " ";
}
#undef PB_DS_CLASS_T_DEC
#undef PB_DS_CLASS_C_DEC
#undef PB_DS_BASE_C_DEC
#endif // #ifdef PB_DS_TREE_TRACE
} // namespace detail
} // namespace __gnu_pbds
#endif // #ifdef PB_DS_TREE_TRACE
#endif // #ifndef PB_DS_TREE_TRACE_BASE_HPP
|
