This file is indexed.

/usr/include/rheolef/compute-bbox.h is in librheolef-dev 5.93-2.

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
#ifndef _RHEO_COMPUTE_BBOX_H
#define _RHEO_COMPUTE_BBOX_H
///
/// This file is part of Rheolef.
///
/// Copyright (C) 2000-2009 Pierre Saramito <Pierre.Saramito@imag.fr>
///
/// Rheolef 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 2 of the License, or
/// (at your option) any later version.
///
/// Rheolef 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.
///
/// You should have received a copy of the GNU General Public License
/// along with Rheolef; if not, write to the Free Software
/// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
/// 
/// =========================================================================
namespace rheolef { 
//
// used by cad and geo classes
//
template <
    	class PointIterator,
	class Point,
	class Size>
void
compute_bbox (
	PointIterator iter_p,
	PointIterator last_p,
	Size	      dim,
	Point&	      xmin,
	Point&	      xmax)
{
  typedef typename Point::float_type                               float_type;
  typedef typename std::iterator_traits<PointIterator>::value_type Point1;

  for (Size j = 0; j < dim; j++) {
    xmin[j] =  std::numeric_limits<float_type>::max();
    xmax[j] = -std::numeric_limits<float_type>::max();
  }
  for (Size j = dim+1; j < 3; j++) {
    xmin [j] = xmax [j] = 0;
  }
  while (iter_p != last_p) {
    const Point1& p = *iter_p++;
    for (Size j = 0 ; j < dim; j++) {
      xmin[j] = min(p[j], xmin[j]);
      xmax[j] = max(p[j], xmax[j]);
    }
  }
}
}// namespace rheolef
#endif // _RHEO_BBOX_H