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
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
|
// Copyright (c) 1997 ETH Zurich (Switzerland).
// 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/SearchStructures/include/CGAL/Range_segment_tree_traits.h $
// $Id: Range_segment_tree_traits.h 28567 2006-02-16 14:30:13Z lsaboret $
//
//
// Author(s) : Gabriele Neyer
#ifndef CGAL_RANGE_SEGMENT_TREE_TRAITS_H
#define CGAL_RANGE_SEGMENT_TREE_TRAITS_H
#include <CGAL/Point_2.h>
#include <CGAL/Point_3.h>
#include <CGAL/predicates_on_points_2.h>
#include <CGAL/predicates_on_points_3.h>
#include <utility>
CGAL_BEGIN_NAMESPACE
template<class Key_1>
class C_Compare_1{
public:
bool operator()(const Key_1& k1, const Key_1& k2)
{
return SMALLER == compare_x(k1,k2);
}
};
template<class Key_2>
class C_Compare_2{
public:
bool operator()(const Key_2& k1, const Key_2& k2)
{
return SMALLER == compare_y(k1,k2);
}
};
template<class Key_3>
class C_Compare_3{
public:
bool operator()(const Key_3& k1, const Key_3& k2)
{
return SMALLER == compare_z(k1,k2);
}
};
template<class Key_1,class Interval>
class C_Low_1{
public:
Key_1 operator()(const Interval& i)
{ return i.first;}
};
template<class Key_1,class Interval>
class C_High_1{
public:
Key_1 operator()(const Interval& i)
{ return i.second;}
};
template<class Key_2,class Interval>
class C_Low_2{
public:
Key_2 operator()(const Interval& i)
{ return i.first;}
};
template<class Key_2,class Interval>
class C_High_2{
public:
Key_2 operator()(const Interval& i)
{ return i.second;}
};
template<class Key_3,class Interval>
class C_Low_3{
public:
Key_3 operator()(const Interval& i)
{ return i.first;}
};
template<class Key_3,class Interval>
class C_High_3{
public:
Key_3 operator()(const Interval& i)
{ return i.second;}
};
template<class Key_1>
class C_Key_1{
public:
Key_1 operator()(const Key_1& k)
{ return k;}
};
template<class Key_2>
class C_Key_2{
public:
Key_2 operator()(const Key_2& k)
{ return k;}
};
template<class Key_3>
class C_Key_3{
public:
Key_3 operator()(const Key_3& k)
{ return k;}
};
template<class Key_1,class Key>
class T_Key_1{
public:
Key_1 operator()(const Key& k)
{ return k.first;}
};
template<class Key_2,class Key>
class T_Key_2{
public:
Key_2 operator()(const Key& k)
{ return k.first;}
};
template<class Key_3,class Key>
class T_Key_3{
public:
Key_3 operator()(const Key& k)
{ return k.first;}
};
template <class Rep, class T>
class Range_tree_map_traits_2{
public:
typedef T Value;
typedef typename Rep::Point_2 Point_2;
typedef Point_2 Pure_key;
typedef std::pair<Pure_key, T> Key;
typedef Point_2 Key_1;
typedef Point_2 Key_2;
typedef std::pair<Pure_key, Pure_key> Interval;
typedef C_Compare_1<Key_1> compare_1;
typedef C_Compare_2<Key_2> compare_2;
typedef C_Low_1<Key_1,Interval> low_1;
typedef C_High_1<Key_1,Interval> high_1;
typedef T_Key_1<Key_1,Key> key_1;
typedef C_Low_2<Key_2,Interval> low_2;
typedef C_High_2<Key_2,Interval> high_2;
typedef T_Key_2<Key_2,Key> key_2;
};
template<class Key_1,class Interval>
class T_Low_1{
public:
Key_1 operator()(const Interval& i)
{ return i.first.first;}
};
template<class Key_1,class Interval>
class T_High_1{
public:
Key_1 operator()(const Interval& i)
{ return i.second.first;}
};
template<class Key_2,class Interval>
class T_Low_2{
public:
Key_2 operator()(const Interval& i)
{ return i.first.first;}
};
template<class Key_2,class Interval>
class T_High_2{
public:
Key_2 operator()(const Interval& i)
{ return i.second.first;}
};
template<class Key_3,class Interval>
class T_Low_3{
public:
Key_3 operator()(const Interval& i)
{ return i.first.first;}
};
template<class Key_3,class Interval>
class T_High_3{
public:
Key_3 operator()(const Interval& i)
{ return i.second.first;}
};
template <class Rep, class T>
class Range_tree_map_traits_3{
public:
typedef typename Rep::Point_3 Point_3;
typedef std::pair<Point_3, T> Key;
typedef Point_3 Pure_key;
typedef Point_3 Key_1;
typedef Point_3 Key_2;
typedef Point_3 Key_3;
typedef std::pair<Key,Key> Interval;
typedef C_Compare_1<Key_1> compare_1;
typedef C_Compare_2<Key_2> compare_2;
typedef C_Compare_3<Key_3> compare_3;
typedef T_Low_1<Key_1,Interval> low_1;
typedef T_High_1<Key_1,Interval> high_1;
typedef T_Key_1<Key_1,Key> key_1;
typedef T_Low_2<Key_2,Interval> low_2;
typedef T_High_2<Key_2,Interval> high_2;
typedef T_Key_2<Key_2,Key> key_2;
typedef T_Low_3<Key_3,Interval> low_3;
typedef T_High_3<Key_3,Interval> high_3;
typedef T_Key_3<Key_3,Key> key_3;
};
template<class Key_1,class Interval>
class S_Low_1{
public:
Key_1 operator()(const Interval& i)
{ return i.first.first;}
};
template<class Key_1,class Interval>
class S_High_1{
public:
Key_1 operator()(const Interval& i)
{ return i.first.second;}
};
template<class Key_2,class Interval>
class S_Low_2{
public:
Key_2 operator()(const Interval& i)
{ return i.first.first;}
};
template<class Key_2,class Interval>
class S_High_2{
public:
Key_2 operator()(const Interval& i)
{ return i.first.second;}
};
template<class Key_3,class Interval>
class S_Low_3{
public:
Key_3 operator()(const Interval& i)
{ return i.first.first;}
};
template<class Key_3,class Interval>
class S_High_3{
public:
Key_3 operator()(const Interval& i)
{ return i.first.second;}
};
template <class Rep, class T>
class Segment_tree_map_traits_2{
public:
typedef T Value;
typedef typename Rep::Point_2 Point_2;
typedef Point_2 Key;
typedef Point_2 Key_1;
typedef Point_2 Key_2;
typedef std::pair<Key,Key> Pure_interval;
typedef std::pair<Pure_interval, T> Interval;
typedef C_Compare_1<Key_1> compare_1;
typedef C_Compare_2<Key_2> compare_2;
typedef S_Low_1<Key_1,Interval> low_1;
typedef S_High_1<Key_1,Interval> high_1;
typedef C_Key_1<Key_1> key_1;
typedef S_Low_2<Key_2,Interval> low_2;
typedef S_High_2<Key_2,Interval> high_2;
typedef C_Key_2<Key_2> key_2;
};
template <class Rep, class T>
class Segment_tree_map_traits_3{
public:
typedef typename Rep::Point_3 Point_3;
typedef Point_3 Key;
typedef Point_3 Key_1;
typedef Point_3 Key_2;
typedef Point_3 Key_3;
typedef std::pair<Key,Key> Pure_interval;
typedef std::pair<Pure_interval,T> Interval;
typedef C_Compare_1<Key_1> compare_1;
typedef C_Compare_2<Key_2> compare_2;
typedef C_Compare_3<Key_3> compare_3;
typedef S_Low_1<Key_1,Interval> low_1;
typedef S_High_1<Key_1,Interval> high_1;
typedef C_Key_1<Key_1> key_1;
typedef S_Low_2<Key_2,Interval> low_2;
typedef S_High_2<Key_2,Interval> high_2;
typedef C_Key_2<Key_2> key_2;
typedef S_Low_3<Key_3,Interval> low_3;
typedef S_High_3<Key_3,Interval> high_3;
typedef C_Key_3<Key_3> key_3;
};
template <class Rep>
class Range_segment_tree_set_traits_3{
public:
typedef typename Rep::Point_3 Point_3;
typedef Point_3 Key;
typedef Point_3 Key_1;
typedef Point_3 Key_2;
typedef Point_3 Key_3;
typedef std::pair<Key,Key> Interval;
typedef C_Compare_1<Key_1> compare_1;
typedef C_Compare_2<Key_2> compare_2;
typedef C_Compare_3<Key_3> compare_3;
typedef C_Low_1<Key_1,Interval> low_1;
typedef C_High_1<Key_1,Interval> high_1;
typedef C_Key_1<Key_1> key_1;
typedef C_Low_2<Key_2,Interval> low_2;
typedef C_High_2<Key_2,Interval> high_2;
typedef C_Key_2<Key_2> key_2;
typedef C_Low_3<Key_3,Interval> low_3;
typedef C_High_3<Key_3,Interval> high_3;
typedef C_Key_3<Key_3> key_3;
};
template <class Rep>
class Range_segment_tree_set_traits_2{
public:
typedef typename Rep::Point_2 Point_2;
typedef Point_2 Key;
typedef Point_2 Key_1;
typedef Point_2 Key_2;
typedef std::pair<Key,Key> Interval;
typedef C_Compare_1<Key_1> compare_1;
typedef C_Compare_2<Key_2> compare_2;
typedef C_Low_1<Key_1,Interval> low_1;
typedef C_High_1<Key_1,Interval> high_1;
typedef C_Key_1<Key_1> key_1;
typedef C_Low_2<Key_2,Interval> low_2;
typedef C_High_2<Key_2,Interval> high_2;
typedef C_Key_2<Key_2> key_2;
};
CGAL_END_NAMESPACE
#endif // CGAL_RANGE_SEGMENT_TREE_TRAITS_H
|
