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
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
|
// Copyright (c) 2003-2006 INRIA Sophia-Antipolis (France).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you may redistribute it under
// the terms of the Q Public License version 1.0.
// See the file LICENSE.QPL distributed with CGAL.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/CGAL-3.2-branch/Curved_kernel/include/CGAL/Arr_circular_arc_traits_tracer.h $
// $Id: Arr_circular_arc_traits_tracer.h 29599 2006-03-18 17:54:04Z spion $
//
// Author(s) : Monique Teillaud, Sylvain Pion
// Partially supported by the IST Programme of the EU as a Shared-cost
// RTD (FET Open) Project under Contract No IST-2000-26473
// (ECG - Effective Computational Geometry for Curves and Surfaces)
// and a STREP (FET Open) Project under Contract No IST-006413
// (ACS -- Algorithms for Complex Shapes)
#ifndef CGAL_CURVED_KERNEL_CIRCULAR_ARC_TRAITS_TRACER_H
#define CGAL_CURVED_KERNEL_CIRCULAR_ARC_TRAITS_TRACER_H
#include <CGAL/basic.h>
#include <cassert>
#include <CGAL/Profile_counter.h>
namespace CGAL {
/// Wrapper around a traits class for Arrangement which just forwards the
/// calls to its nested traits, and prints debug info for each argument and
/// return value. Compiling with -DCGAL_PROFILE dumps the number of calls
/// to each predicate at the end of the program.
// to get better profiles for the traits interface :
#ifndef CGAL_NO_INLINE
# ifdef __GNUG__
# define CGAL_NO_INLINE __attribute__((__noinline__))
# else
# define CGAL_NO_INLINE
# endif
#endif
// FIXME : the .id() came from the Debug_id base class, which used to be
// intrusive. Maybe the tracer could add it to the objects itself...
template < typename Traits, int debug_level = 2 >
class Circular_arc_traits_tracer
: public Traits
{
typedef Circular_arc_traits_tracer<Traits, debug_level> Self;
// debug_level :
// 0 = no debug messages
// 1 = important messages
// 2 = maybe important messages
// 3 = all calls
// Traits traits;
mutable int nested_level; /// for detection of nested calls
mutable int call_number; /// identifies the call number
// FIXME : transform these macros into member functions ?
#define CGAL_DEBUG(level, args) if (level <= debug_level) \
{ std::cout << "Call #" << t->call_number++ << " " << CGAL_PRETTY_FUNCTION \
<< " ( " << args << " )"; \
if (t->nested_level != 0) \
std::cout << " [ nested level " << t->nested_level << " ]"; \
++t->nested_level; \
std::cout << std::endl; }
#define CGAL_DEBUG_RET(level, args) if (level <= debug_level) \
{ std::cout << " returns : " << args; \
--t->nested_level; \
if (t->nested_level != 0) \
std::cout << " [ nested level " << t->nested_level << " ]"; \
std::cout << std::endl; }
public:
typedef typename Traits::Kernel Kernel;
typedef typename Traits::Curve_2 Curve_2;
typedef typename Traits::X_monotone_curve_2 X_monotone_curve_2;
typedef typename Traits::Point Point;
typedef typename Traits::Point_2 Point_2;
typedef typename Kernel::Circle_2 Circle;
typedef typename Kernel::Circular_arc_2 Circular_arc;
typedef typename Traits::Has_left_category Has_left_category;
typedef typename Traits::Has_merge_category Has_merge_category;
const Traits & traits () const
{ return static_cast<const Traits &>(*this); }
Circular_arc_traits_tracer(const Traits &t = Traits())
: Traits(t), nested_level(0), call_number(0) {}
struct Compare_x_2 {
Compare_x_2(const Self *tt) :t(tt) {}
const Self *t;
CGAL::Comparison_result
CGAL_NO_INLINE
operator()(const Point_2 &p, const Point_2 &q) const
{
CGAL_PROFILER(__FUNCTION__);
CGAL_DEBUG(2, p.id() << ", " << q.id());
CGAL::Comparison_result ret = t->traits().compare_x_2_object()(p, q);
CGAL_DEBUG_RET(2, ret);
return ret;
}
};
Compare_x_2
compare_x_2_object() const
{ return Compare_x_2(this); }
struct Compare_y_2 {
Compare_y_2(const Self *tt) :t(tt) {}
const Self *t;
CGAL::Comparison_result
CGAL_NO_INLINE
operator()(const Point_2 &p, const Point_2 &q) const
{
CGAL_PROFILER(__FUNCTION__);
CGAL_DEBUG(2, p.id() << ", " << q.id());
CGAL::Comparison_result ret = t->traits().compare_y_2_object()(p, q);
CGAL_DEBUG_RET(2, ret);
return ret;
}
};
Compare_y_2
compare_y_2_object() const
{ return Compare_y_2(this); }
struct Equal_2 {
Equal_2(const Self *tt) :t(tt) {}
const Self *t;
bool
CGAL_NO_INLINE
operator()(const Point_2 &p, const Point_2 &q) const
{
CGAL_PROFILER(__FUNCTION__);
CGAL_DEBUG(2, p.id() << ", " << q.id());
bool ret = t->traits().equal_2_object()(p, q);
CGAL_DEBUG_RET(2, ret);
return ret;
}
bool
CGAL_NO_INLINE
operator()(const Circular_arc &a1, const Circular_arc &a2) const
{
CGAL_PROFILER(__FUNCTION__);
CGAL_DEBUG(2, a1.id() << ", " << a2.id());
bool ret = t->traits().equal_2_object()(a1, a2);
CGAL_DEBUG_RET(2, ret);
return ret;
}
};
Equal_2
equal_2_object() const
{ return Equal_2(this); }
struct Intersect_2 {
Intersect_2(const Self *tt) :t(tt) {}
const Self *t;
template < class OutputIterator >
OutputIterator
CGAL_NO_INLINE
operator()(const Circle & c1, const Circle & c2,
OutputIterator res) const
{
CGAL_PROFILER(__FUNCTION__);
CGAL_DEBUG(2, c1.id() << ", " << c2.id());
std::vector<CGAL::Object> ret;
t->traits().intersect_2_object()(c1, c2,
std::back_inserter(ret));
if (2 <= debug_level)
{
std::cout << " returns : ";
for(int i=0; i<ret.size(); ++i) {
//Point_2 p;
//Circular_arc c;
//std::pair<Point_2, int> pp;
if (const Point_2 *p = CGAL::object_cast<Point_2>(&ret[i])) {
std::cout << *p << " ";
}
else if (const Circular_arc *c = CGAL::object_cast<Circular_arc>(&ret[i])) {
std::cout << *c << " ";
}
else if (const std::pair<Point_2, int> *pp = CGAL::object_cast<std::pair<Point_2, int> >(&ret[i])) {
std::cout << " pair ( " << pp->first << " ; " <<
pp->second << " ) ";
}
else {
std::cout << " [ something else ? ] ";
}
}
--nested_level;
if (nested_level != 0)
std::cout << " [ nested level " << nested_level << " ]";
std::cout << std::endl;
}
return std::copy(ret.begin(), ret.end(), res);
}
template < class OutputIterator >
OutputIterator
CGAL_NO_INLINE
operator()(const Circular_arc & c1, const Circular_arc & c2,
OutputIterator res) const
{
CGAL_PROFILER(__FUNCTION__);
CGAL_DEBUG(2, c1.id() << ", " << c2.id());
std::vector<CGAL::Object> ret;
t->traits().intersect_2_object()(c1, c2, std::back_inserter(ret));
if (2 <= debug_level)
{
std::cout << " returns : ";
for(unsigned i=0; i<ret.size(); ++i) {
// Point_2 p;
// Circular_arc c;
// std::pair<Point_2, unsigned> pp;
if (const Point_2 *p = CGAL::object_cast<Point_2>(&ret[i])) {
std::cout << *p << " ";
}
else if (const Circular_arc *c = CGAL::object_cast<Circular_arc>(&ret[i])) {
std::cout << *c << " ";
}
else if (const std::pair<Point_2, unsigned> *pp = CGAL::object_cast<std::pair<Point_2, unsigned> > (&ret[i])) {
std::cout << " pair ( " << pp->first << " ; " <<
pp->second << " ) ";
}
else {
std::cout << " [ something else ? ] ";
}
}
--t->nested_level;
if (t->nested_level != 0)
std::cout << " [ nested level " << t->nested_level << " ]";
std::cout << std::endl;
}
return std::copy(ret.begin(), ret.end(), res);
}
};
Intersect_2
intersect_2_object() const
{ return Intersect_2(this); }
};
} // namespace CGAL
#endif // CGAL_CURVED_KERNEL_CIRCULAR_ARC_TRAITS_TRACER_H
|
