This file is indexed.

/usr/include/OpenEXR/ImathBox.h is in libilmbase-dev 1.0.1-6.1.

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
///////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2004, Industrial Light & Magic, a division of Lucas
// Digital Ltd. LLC
// 
// All rights reserved.
// 
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
// *       Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// *       Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// *       Neither the name of Industrial Light & Magic nor the names of
// its contributors may be used to endorse or promote products derived
// from this software without specific prior written permission. 
// 
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
///////////////////////////////////////////////////////////////////////////


#ifndef INCLUDED_IMATHBOX_H
#define INCLUDED_IMATHBOX_H

//-------------------------------------------------------------------
//
//	class Imath::Box<class T>
//	--------------------------------
//
//	This class imposes the following requirements on its 
//	parameter class:
//	
//	1) The class T must implement these operators:
//			+ - < > <= >= = 
//	   with the signature (T,T) and the expected 
//	   return values for a numeric type. 
//
//	2) The class T must implement operator=
//	   with the signature (T,float and/or double)
//
//	3) The class T must have a constructor which takes
//	   a float (and/or double) for use in initializing the box.
//
//	4) The class T must have a function T::dimensions()
//	   which returns the number of dimensions in the class
//	   (since its assumed its a vector) -- preferably, this
//	   returns a constant expression.
//
//-------------------------------------------------------------------

#include "ImathVec.h"

namespace Imath {


template <class T>	
class Box
{
  public:

    //-------------------------
    //  Data Members are public
    //-------------------------

    T				min;
    T				max;

    //-----------------------------------------------------
    //	Constructors - an "empty" box is created by default
    //-----------------------------------------------------

    Box(); 
    Box(const T& point);
    Box(const T& minT, const T& maxT);

    //--------------------
    //  Operators:  ==, !=
    //--------------------
    
    bool                        operator == (const Box<T> &src) const;
    bool                        operator != (const Box<T> &src) const;

    //------------------
    //	Box manipulation
    //------------------

    void			makeEmpty();
    void			extendBy(const T& point);
    void			extendBy(const Box<T>& box);

    //---------------------------------------------------
    //	Query functions - these compute results each time
    //---------------------------------------------------

    T				size() const;
    T				center() const;
    bool			intersects(const T &point) const;
    bool			intersects(const Box<T> &box) const;

    unsigned int		majorAxis() const;

    //----------------
    //	Classification
    //----------------

    bool			isEmpty() const;
    bool			hasVolume() const;
};


//--------------------
// Convenient typedefs
//--------------------


typedef Box <V2s> Box2s;
typedef Box <V2i> Box2i;
typedef Box <V2f> Box2f;
typedef Box <V2d> Box2d;
typedef Box <V3s> Box3s;
typedef Box <V3i> Box3i;
typedef Box <V3f> Box3f;
typedef Box <V3d> Box3d;


//----------------
//  Implementation
//----------------


template <class T>
inline Box<T>::Box()
{
    makeEmpty();
}

template <class T>
inline Box<T>::Box(const T& point)
{
    min = point;
    max = point;
}

template <class T>
inline Box<T>::Box(const T& minV, const T& maxV)
{
    min = minV;
    max = maxV;
}

template <class T>
inline bool
Box<T>::operator == (const Box<T> &src) const
{
    return (min == src.min && max == src.max);
}

template <class T>
inline bool
Box<T>::operator != (const Box<T> &src) const
{
    return (min != src.min || max != src.max);
}

template <class T>
inline void Box<T>::makeEmpty()
{
    min = T(T::baseTypeMax());
    max = T(T::baseTypeMin());
}

template <class T>
inline void Box<T>::extendBy(const T& point)
{
    for (unsigned int i=0; i<min.dimensions(); i++)
    {
	if ( point[i] < min[i] ) min[i] = point[i];
	if ( point[i] > max[i] ) max[i] = point[i];
    }
}

template <class T>
inline void Box<T>::extendBy(const Box<T>& box)
{
    for (unsigned int i=0; i<min.dimensions(); i++)
    {
	if ( box.min[i] < min[i] ) min[i] = box.min[i];
	if ( box.max[i] > max[i] ) max[i] = box.max[i];
    }
}

template <class T>
inline bool Box<T>::intersects(const T& point) const
{
    for (unsigned int i=0; i<min.dimensions(); i++)
    {
        if (point[i] < min[i] || point[i] > max[i]) return false;
    }
    return true;
}

template <class T>
inline bool Box<T>::intersects(const Box<T>& box) const
{
    for (unsigned int i=0; i<min.dimensions(); i++)
    {
        if (box.max[i] < min[i] || box.min[i] > max[i]) return false;
    }
    return true;
}

template <class T> 
inline T Box<T>::size() const 
{ 
    if (isEmpty())
	return T (0);

    return max-min;
}

template <class T> 
inline T Box<T>::center() const 
{ 
    return (max+min)/2;
}

template <class T>
inline bool Box<T>::isEmpty() const
{
    for (unsigned int i=0; i<min.dimensions(); i++)
    {
        if (max[i] < min[i]) return true;
    }
    return false;
}

template <class T>
inline bool Box<T>::hasVolume() const
{
    for (unsigned int i=0; i<min.dimensions(); i++)
    {
        if (max[i] <= min[i]) return false;
    }
    return true;
}

template<class T>
inline unsigned int Box<T>::majorAxis() const
{
    unsigned int major = 0;
    T s = size();

    for (unsigned int i=1; i<min.dimensions(); i++)
    {
	if ( s[i] > s[major] ) major = i;
    }

    return major;
}

} // namespace Imath

#endif