This file is indexed.

/usr/include/CGAL/Range_tree_k.h is in libcgal-dev 4.2-5ubuntu1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  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
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
// Copyright (c) 1997  ETH Zurich (Switzerland).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org).
// 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 of the License, or (at your option) any later version.
//
// 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$
// $Id$
// 
//
// Author(s)     : Gabriele Neyer

#ifndef CGAL_RANGE_TREE_K_H
#define CGAL_RANGE_TREE_K_H

// Predefined k-dimensional Range Trees (k=1..4) 
// The trees can either be templated with d arbitrary types
// (e.g., Range_tree_3) 
// or with an unary type for each dimension
// (e.g., Range_tree_uni_4).
// The container class and sequence container class as well as the 
// interfaces are defined in these classes.

#include <iostream>
#include <iterator>
#include <CGAL/Tree_base.h>
#include <CGAL/Tree_traits.h>
#include <CGAL/Range_tree_d.h>

//-------------------------------------------------------------------
// A one dimensional Range Tree is defined in this class.
// Ti is the type of each dimension of the tree.

namespace CGAL {


template <class C_Traits_1>
class Range_tree_1
{ 

public:
  typedef C_Traits_1 Traits;
  typedef typename C_Traits_1::Key Key;
  typedef typename C_Traits_1::Interval Interval;
  typedef typename C_Traits_1::Key_1 Key_1;
  typedef typename C_Traits_1::key_1 key_1;
  typedef typename C_Traits_1::low_1 low_1;
  typedef typename C_Traits_1::high_1 high_1;
  typedef typename C_Traits_1::compare_1 compare_1;


  typedef tree_point_traits<Key, Interval, Key_1, 
                            key_1, low_1, high_1, compare_1> I1;

  typedef Tree_anchor<Key, Interval> Tree_anchor_type;
  Tree_anchor_type *anchor;

  typedef Range_tree_d<Key, Interval, I1> Range_tree_1_type;
  Range_tree_1_type * range_tree_1;


  Range_tree_1()
  {
    anchor = new Tree_anchor_type;
    range_tree_1 = new Range_tree_1_type(*anchor);
  }

  template <class T>
  Range_tree_1(const T& first, 
	       const T& last)  
    : anchor(new Tree_anchor_type), range_tree_1(new Range_tree_1_type(*anchor))
  {
   range_tree_1->make_tree(first,last);
  }

  template <class T>
  bool make_tree(const T& first, 
		 const T& last)
  {
    delete range_tree_1;
    delete anchor;
    anchor = new Tree_anchor_type;
    range_tree_1 = new Range_tree_1_type(*anchor);
    return range_tree_1->make_tree(first,last);
  }

  template <class T>
  T  window_query(Interval const &win,  
		  const T& result)
  {
    return range_tree_1->window_query(win, result);
  }

  ~Range_tree_1()
  {
    if (range_tree_1!=0)
      delete range_tree_1;
    if (anchor!=0)
      delete anchor;
  }

};


//-------------------------------------------------------------------
// A two dimensional Range Tree is defined in this class.
// Ti is the type of each dimension of the tree.

template <class C_Traits_2>
class Range_tree_2
{ 

public:
  typedef C_Traits_2 Traits;
  typedef typename C_Traits_2::Key Key;
  typedef typename C_Traits_2::Interval Interval;
  typedef typename C_Traits_2::Key_2 Key_2;
  typedef typename C_Traits_2::Key_1 Key_1;
  typedef typename C_Traits_2::key_1 key_1;
  typedef typename C_Traits_2::key_2 key_2;
  typedef typename C_Traits_2::low_1 low_1;
  typedef typename C_Traits_2::high_1 high_1;
  typedef typename C_Traits_2::low_2 low_2;
  typedef typename C_Traits_2::high_2 high_2;
  typedef typename C_Traits_2::compare_1 compare_1;
  typedef typename C_Traits_2::compare_2 compare_2;


  typedef tree_point_traits<Key, Interval, 
                            Key_1, key_1, low_1, high_1, compare_1> I1;

  typedef tree_point_traits<Key, Interval, 
                            Key_2, key_2, low_2, high_2, compare_2> I2;


  typedef Tree_anchor<Key, Interval> Tree_anchor_type;
  Tree_anchor_type *anchor;

  typedef Range_tree_d<Key, Interval, I2> Range_tree_1_type;
  Range_tree_1_type * range_tree_1;

  typedef Range_tree_d<Key, Interval, I1> Range_tree_2_type;
  Range_tree_2_type *range_tree_2;


  Range_tree_2()
    : anchor(new Tree_anchor_type),
      range_tree_1(new Range_tree_1_type(*anchor)),
      range_tree_2(new Range_tree_2_type(*range_tree_1))
  {}

  template <class T>
  Range_tree_2(const T& first, 
	       const T& last)
    : anchor(new Tree_anchor_type),
      range_tree_1(new Range_tree_1_type(*anchor)),
      range_tree_2(new Range_tree_2_type(*range_tree_1))
  {
    range_tree_2->make_tree(first,last);
  }

  template <class T>
  bool make_tree(const T& first, 
		 const T& last)
  {
    delete range_tree_2;
    delete range_tree_1;
    delete anchor;
    anchor = new Tree_anchor_type;
    range_tree_1 = new Range_tree_1_type(*anchor);
    range_tree_2 = new Range_tree_2_type(*range_tree_1);
    return range_tree_2->make_tree(first,last);
  }
  
  template <class T>
  T window_query(Interval const &win,  
		 const T& result)
  {
    return range_tree_2->window_query(win, result);
  }

  ~Range_tree_2()
  {
    if (range_tree_2!=0)
      delete range_tree_2;
    if (range_tree_1!=0)
      delete range_tree_1;
    if (anchor!=0)
      delete anchor;
  }
};

//-------------------------------------------------------------------
// A three dimensional Range Tree is defined in this class.
// Ti is the type of each dimension of the tree.
template <class C_Traits_3>
class Range_tree_3
{ 
public:
  typedef C_Traits_3 Traits;
  typedef typename C_Traits_3::Key Key;
  typedef typename C_Traits_3::Interval Interval;
  typedef typename C_Traits_3::Key_1 Key_1;
  typedef typename C_Traits_3::Key_2 Key_2;
  typedef typename C_Traits_3::Key_3 Key_3;
  typedef typename C_Traits_3::key_1 key_1;
  typedef typename C_Traits_3::key_2 key_2;
  typedef typename C_Traits_3::key_3 key_3;
  typedef typename C_Traits_3::low_1 low_1;
  typedef typename C_Traits_3::high_1 high_1;
  typedef typename C_Traits_3::low_2 low_2;
  typedef typename C_Traits_3::high_2 high_2;
  typedef typename C_Traits_3::low_3 low_3;
  typedef typename C_Traits_3::high_3 high_3;
  typedef typename C_Traits_3::compare_1 compare_1;
  typedef typename C_Traits_3::compare_2 compare_2;
  typedef typename C_Traits_3::compare_3 compare_3;

  typedef tree_point_traits<Key, Interval, Key_1,
                            key_1, low_1, high_1, compare_1> I1;

  typedef tree_point_traits<Key, Interval, Key_2,
                            key_2, low_2, high_2, compare_2> I2;

  typedef tree_point_traits<Key, Interval, Key_3, 
                            key_3, low_3, high_3, compare_3> I3;

  typedef Tree_anchor<Key, Interval> Tree_anchor_type;
  Tree_anchor_type *anchor;

  typedef Range_tree_d<Key, Interval, I3> Range_tree_1_type;
  Range_tree_1_type * range_tree_1;

  typedef Range_tree_d<Key, Interval, I2> Range_tree_2_type;
  Range_tree_2_type * range_tree_2;

  typedef Range_tree_d<Key, Interval, I1> Range_tree_3_type;
  Range_tree_3_type *range_tree_3;

  Range_tree_3()
    : anchor(new Tree_anchor_type),
      range_tree_1(new Range_tree_1_type(*anchor)),
      range_tree_2(new Range_tree_2_type(*range_tree_1)),
      range_tree_3(new Range_tree_3_type(*range_tree_2))
  {}
  
  template <class T>
  Range_tree_3(const T& first, 
	       const T& last)
    : anchor(new Tree_anchor_type),
      range_tree_1(new Range_tree_1_type(*anchor)),
      range_tree_2(new Range_tree_2_type(*range_tree_1)),
      range_tree_3(new Range_tree_3_type(*range_tree_2))
  {
    range_tree_3->make_tree(first,last);
  }

  template <class T>
  bool make_tree(const T& first, 
		 const T& last)
  {
    delete range_tree_3;
    delete range_tree_2;
    delete range_tree_1;
    delete anchor;
    anchor = new Tree_anchor_type;
    range_tree_1 = new Range_tree_1_type(*anchor);
    range_tree_2 = new Range_tree_2_type(*range_tree_1);
    range_tree_3 = new Range_tree_3_type(*range_tree_2);
    return range_tree_3->make_tree(first,last);
  }
  
  template <class T>
  T  window_query(Interval const &win,  
		  const T& result)
  {
    return range_tree_3->window_query(win, result);
  }

  ~Range_tree_3()
  {
    if (range_tree_3!=0)
      delete range_tree_3;
    if (range_tree_2!=0)
      delete range_tree_2;
    if (range_tree_1!=0)
      delete range_tree_1;
    if (anchor!=0)
      delete anchor;
  }
};


//-------------------------------------------------------------------
// A three dimensional Range Tree is defined in this class.
// Ti is the type of each dimension of the tree.

template <class C_Traits_4>
class Range_tree_4
{ 
public:
  typedef C_Traits_4 Traits;
  typedef typename C_Traits_4::Key Key;
  typedef typename C_Traits_4::Interval Interval;
  typedef typename C_Traits_4::Key_1 Key_1;
  typedef typename C_Traits_4::Key_2 Key_2;
  typedef typename C_Traits_4::Key_3 Key_3;
  typedef typename C_Traits_4::Key_4 Key_4;
  typedef typename C_Traits_4::key_1 key_1;
  typedef typename C_Traits_4::key_2 key_2;
  typedef typename C_Traits_4::key_4 key_4;
  typedef typename C_Traits_4::key_3 key_3;
  typedef typename C_Traits_4::low_1 low_1;
  typedef typename C_Traits_4::high_1 high_1;
  typedef typename C_Traits_4::low_2 low_2;
  typedef typename C_Traits_4::high_2 high_2;
  typedef typename C_Traits_4::low_3 low_3;
  typedef typename C_Traits_4::high_3 high_3;
  typedef typename C_Traits_4::low_4 low_4;
  typedef typename C_Traits_4::high_4 high_4;
  typedef typename C_Traits_4::compare_1 compare_1;
  typedef typename C_Traits_4::compare_2 compare_2;
  typedef typename C_Traits_4::compare_3 compare_3;
  typedef typename C_Traits_4::compare_4 compare_4;

  typedef tree_point_traits<Key, Interval, Key_1,
                            key_1, low_1, high_1, compare_1> I1;  

  typedef tree_point_traits<Key, Interval, Key_2,
                            key_2, low_2, high_2, compare_2> I2;  

  typedef tree_point_traits<Key, Interval, Key_3,
                            key_3, low_3, high_3, compare_3> I3;  

  typedef tree_point_traits<Key, Interval, Key_4, 
                            key_4, low_4, high_4, compare_4> I4;  

  typedef Tree_anchor<Key, Interval> Tree_anchor_type;
  Tree_anchor_type *anchor;

  typedef Range_tree_d<Key, Interval, I4> Range_tree_1_type;
  Range_tree_1_type * range_tree_1;

  typedef Range_tree_d<Key, Interval, I3> Range_tree_2_type;
  Range_tree_2_type * range_tree_2;

  typedef Range_tree_d<Key, Interval, I2> Range_tree_3_type;
  Range_tree_3_type *range_tree_3;

  typedef Range_tree_d<Key, Interval, I1> Range_tree_4_type;
  Range_tree_4_type *range_tree_4;

  Range_tree_4()
    : anchor(new Tree_anchor_type),
      range_tree_1(new Range_tree_1_type(*anchor)),
      range_tree_2(new Range_tree_2_type(*range_tree_1)),
      range_tree_3(new Range_tree_3_type(*range_tree_2)),
      range_tree_4(new Range_tree_4_type(*range_tree_3))
  {}

  template <class T>
  Range_tree_4(const T& first, 
	       const T& last)
    : anchor(new Tree_anchor_type),
      range_tree_1(new Range_tree_1_type(*anchor)),
      range_tree_2(new Range_tree_2_type(*range_tree_1)),
      range_tree_3(new Range_tree_3_type(*range_tree_2)),
      range_tree_4(new Range_tree_4_type(*range_tree_3))
  {
    range_tree_4->make_tree(first,last);
  }

  template <class T>
  bool make_tree(const T& first, 
		 const T& last)
  {
    delete range_tree_4;
    delete range_tree_3;
    delete range_tree_2;
    delete range_tree_1;
    delete anchor;
    anchor = new Tree_anchor_type;
    range_tree_1 = new Range_tree_1_type(*anchor);
    range_tree_2 = new Range_tree_2_type(*range_tree_1);
    range_tree_3 = new Range_tree_3_type(*range_tree_2);
    range_tree_4 = new Range_tree_4_type(*range_tree_3);
    return range_tree_4->make_tree(first,last);
  }

  template <class T>
  T  window_query(Interval const &win,  
		  const T& result)
  {
    return range_tree_4->window_query(win, result);
  }

  ~Range_tree_4()
  {
    if (range_tree_4!=0)
      delete range_tree_4;
    if (range_tree_3!=0)
      delete range_tree_3;
    if (range_tree_2!=0)
      delete range_tree_2;
    if (range_tree_1!=0)
      delete range_tree_1;
    if (anchor!=0)
      delete anchor;
  }
};

} //namespace CGAL

#endif