Gecko [ nrupathungauniversityblr.ac.in ]

Name	Size	Permission
Iex.h	2.34 KB	-rw-r--r--
IexBaseExc.h	9.06 KB	-rw-r--r--
IexErrnoExc.h	7.37 KB	-rw-r--r--
IexExport.h	2.08 KB	-rw-r--r--
IexForward.h	5.1 KB	-rw-r--r--
IexMacros.h	5.63 KB	-rw-r--r--
IexMathExc.h	2.41 KB	-rw-r--r--
IexMathFloatExc.h	4.58 KB	-rw-r--r--
IexMathFpu.h	3.3 KB	-rw-r--r--
IexMathIeeeExc.h	2.3 KB	-rw-r--r--
IexNamespace.h	4.3 KB	-rw-r--r--
IexThrowErrnoExc.h	3.4 KB	-rw-r--r--
IlmBaseConfig.h	1.64 KB	-rw-r--r--
IlmThread.h	4.78 KB	-rw-r--r--
IlmThreadExport.h	2.15 KB	-rw-r--r--
IlmThreadForward.h	2.08 KB	-rw-r--r--
IlmThreadMutex.h	4.32 KB	-rw-r--r--
IlmThreadNamespace.h	4.54 KB	-rw-r--r--
IlmThreadPool.h	5.21 KB	-rw-r--r--
IlmThreadSemaphore.h	3.38 KB	-rw-r--r--
ImathBox.h	16.62 KB	-rw-r--r--
ImathBoxAlgo.h	22.35 KB	-rw-r--r--
ImathColor.h	14.87 KB	-rw-r--r--
ImathColorAlgo.h	7.08 KB	-rw-r--r--
ImathEuler.h	22.88 KB	-rw-r--r--
ImathExc.h	2.82 KB	-rw-r--r--
ImathExport.h	2.13 KB	-rw-r--r--
ImathForward.h	2.68 KB	-rw-r--r--
ImathFrame.h	6.6 KB	-rw-r--r--
ImathFrustum.h	22.26 KB	-rw-r--r--
ImathFrustumTest.h	14.77 KB	-rw-r--r--
ImathFun.h	5.99 KB	-rw-r--r--
ImathGL.h	4.52 KB	-rw-r--r--
ImathGLU.h	2.17 KB	-rw-r--r--
ImathHalfLimits.h	2.47 KB	-rw-r--r--
ImathInt64.h	2.4 KB	-rw-r--r--
ImathInterval.h	5.34 KB	-rw-r--r--
ImathLimits.h	7.76 KB	-rw-r--r--
ImathLine.h	4.74 KB	-rw-r--r--
ImathLineAlgo.h	7.68 KB	-rw-r--r--
ImathMath.h	7.17 KB	-rw-r--r--
ImathMatrix.h	82.42 KB	-rw-r--r--
ImathMatrixAlgo.h	37.97 KB	-rw-r--r--
ImathNamespace.h	4.38 KB	-rw-r--r--
ImathPlane.h	6.75 KB	-rw-r--r--
ImathPlatform.h	3.23 KB	-rw-r--r--
ImathQuat.h	20.94 KB	-rw-r--r--
ImathRandom.h	9.84 KB	-rw-r--r--
ImathRoots.h	5.62 KB	-rw-r--r--
ImathShear.h	13.85 KB	-rw-r--r--
ImathSphere.h	4.68 KB	-rw-r--r--
ImathVec.h	44.17 KB	-rw-r--r--
ImathVecAlgo.h	4.64 KB	-rw-r--r--
ImfAcesFile.h	10.27 KB	-rw-r--r--
ImfArray.h	6.79 KB	-rw-r--r--
ImfAttribute.h	10.36 KB	-rw-r--r--
ImfB44Compressor.h	3.67 KB	-rw-r--r--
ImfBoxAttribute.h	3.1 KB	-rw-r--r--
ImfCRgbaFile.h	12.5 KB	-rw-r--r--
ImfChannelList.h	11.2 KB	-rw-r--r--
ImfChannelListAttribute.h	2.69 KB	-rw-r--r--
ImfChromaticities.h	4.45 KB	-rw-r--r--
ImfChromaticitiesAttribute.h	2.74 KB	-rw-r--r--
ImfCompositeDeepScanLine.h	5.38 KB	-rw-r--r--
ImfCompression.h	3.25 KB	-rw-r--r--
ImfCompressionAttribute.h	2.71 KB	-rw-r--r--
ImfConvert.h	3.39 KB	-rw-r--r--
ImfDeepCompositing.h	5.97 KB	-rw-r--r--
ImfDeepFrameBuffer.h	8.79 KB	-rw-r--r--
ImfDeepImageState.h	3.67 KB	-rw-r--r--
ImfDeepImageStateAttribute.h	2.64 KB	-rw-r--r--
ImfDeepScanLineInputFile.h	11.01 KB	-rw-r--r--
ImfDeepScanLineInputPart.h	6.9 KB	-rw-r--r--
ImfDeepScanLineOutputFile.h	9.37 KB	-rw-r--r--
ImfDeepScanLineOutputPart.h	6.41 KB	-rw-r--r--
ImfDeepTiledInputFile.h	16.08 KB	-rw-r--r--
ImfDeepTiledInputPart.h	13.27 KB	-rw-r--r--
ImfDeepTiledOutputFile.h	18.1 KB	-rw-r--r--
ImfDeepTiledOutputPart.h	14.83 KB	-rw-r--r--
ImfDoubleAttribute.h	2.29 KB	-rw-r--r--
ImfEnvmap.h	11.29 KB	-rw-r--r--
ImfEnvmapAttribute.h	2.67 KB	-rw-r--r--
ImfExport.h	2.11 KB	-rw-r--r--
ImfFloatAttribute.h	2.26 KB	-rw-r--r--
ImfForward.h	3.48 KB	-rw-r--r--
ImfFrameBuffer.h	11.18 KB	-rw-r--r--
ImfFramesPerSecond.h	3.79 KB	-rw-r--r--
ImfGenericInputFile.h	2.26 KB	-rw-r--r--
ImfGenericOutputFile.h	2.44 KB	-rw-r--r--
ImfHeader.h	19.27 KB	-rw-r--r--
ImfHuf.h	2.86 KB	-rw-r--r--
ImfIO.h	7.45 KB	-rw-r--r--
ImfInputFile.h	8.28 KB	-rw-r--r--
ImfInputPart.h	3.52 KB	-rw-r--r--
ImfInt64.h	2.24 KB	-rw-r--r--
ImfIntAttribute.h	2.27 KB	-rw-r--r--
ImfKeyCode.h	4.9 KB	-rw-r--r--
ImfKeyCodeAttribute.h	2.65 KB	-rw-r--r--
ImfLineOrder.h	2.42 KB	-rw-r--r--
ImfLineOrderAttribute.h	2.67 KB	-rw-r--r--
ImfLut.h	5.12 KB	-rw-r--r--
ImfMatrixAttribute.h	3.65 KB	-rw-r--r--
ImfMisc.h	16.33 KB	-rw-r--r--
ImfMultiPartInputFile.h	3.94 KB	-rw-r--r--
ImfMultiPartOutputFile.h	4.29 KB	-rw-r--r--
ImfMultiView.h	6.29 KB	-rw-r--r--
ImfName.h	3.52 KB	-rw-r--r--
ImfNamespace.h	4.46 KB	-rw-r--r--
ImfOpaqueAttribute.h	3.55 KB	-rw-r--r--
ImfOutputFile.h	9.66 KB	-rw-r--r--
ImfOutputPart.h	3.04 KB	-rw-r--r--
ImfPartHelper.h	7.66 KB	-rw-r--r--
ImfPartType.h	2.38 KB	-rw-r--r--
ImfPixelType.h	2.34 KB	-rw-r--r--
ImfPreviewImage.h	4.65 KB	-rw-r--r--
ImfPreviewImageAttribute.h	2.68 KB	-rw-r--r--
ImfRational.h	3.17 KB	-rw-r--r--
ImfRationalAttribute.h	2.63 KB	-rw-r--r--
ImfRgba.h	3.08 KB	-rw-r--r--
ImfRgbaFile.h	13.09 KB	-rw-r--r--
ImfRgbaYca.h	8.21 KB	-rw-r--r--
ImfStandardAttributes.h	13.26 KB	-rw-r--r--
ImfStringAttribute.h	2.58 KB	-rw-r--r--
ImfStringVectorAttribute.h	2.7 KB	-rw-r--r--
ImfTestFile.h	3.55 KB	-rw-r--r--
ImfThreading.h	4.24 KB	-rw-r--r--
ImfTileDescription.h	3.13 KB	-rw-r--r--
ImfTileDescriptionAttribute.h	2.7 KB	-rw-r--r--
ImfTiledInputFile.h	13.82 KB	-rw-r--r--
ImfTiledInputPart.h	4.55 KB	-rw-r--r--
ImfTiledOutputFile.h	17.83 KB	-rw-r--r--
ImfTiledOutputPart.h	4.75 KB	-rw-r--r--
ImfTiledRgbaFile.h	15.89 KB	-rw-r--r--
ImfTimeCode.h	7 KB	-rw-r--r--
ImfTimeCodeAttribute.h	2.64 KB	-rw-r--r--
ImfVecAttribute.h	4.45 KB	-rw-r--r--
ImfVersion.h	4.64 KB	-rw-r--r--
ImfWav.h	2.73 KB	-rw-r--r--
ImfXdr.h	18.74 KB	-rw-r--r--
OpenEXRConfig.h	1.8 KB	-rw-r--r--
half.h	17.22 KB	-rw-r--r--
halfExport.h	757 B	-rw-r--r--
halfFunction.h	4.83 KB	-rw-r--r--
halfLimits.h	3.73 KB	-rw-r--r--

Code Editor : ImathBox.h

///////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2004-2012, 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"
#include "ImathNamespace.h"

IMATH_INTERNAL_NAMESPACE_HEADER_ENTER

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);
    void		makeInfinite ();

//---------------------------------------------------
    //	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;
    bool		isInfinite () 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 &minT, const T &maxT)
{
    min = minT;
    max = maxT;
}

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>::makeInfinite()
{
    min = T(T::baseTypeMin());
    max = T(T::baseTypeMax());
}

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>::isInfinite() const
{
    for (unsigned int i = 0; i < min.dimensions(); i++)
    {
        if (min[i] != T::baseTypeMin() || max[i] != T::baseTypeMax())
	    return false;
    }

return true;
}

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;
}

//-------------------------------------------------------------------
//
//  Partial class specializations for Imath::Vec2<T> and Imath::Vec3<T>
//
//-------------------------------------------------------------------

template <typename T> class Box;

template <class T>
class Box<Vec2<T> >
{
  public:

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

Vec2<T>		min;
    Vec2<T>		max;

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

Box(); 
    Box (const Vec2<T> &point);
    Box (const Vec2<T> &minT, const Vec2<T> &maxT);

//--------------------
    //  Operators:  ==, !=
    //--------------------

bool		operator == (const Box<Vec2<T> > &src) const;
    bool		operator != (const Box<Vec2<T> > &src) const;

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

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

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

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

unsigned int	majorAxis() const;

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

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

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

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

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

template <class T>
inline Box<Vec2<T> >::Box (const Vec2<T> &minT, const Vec2<T> &maxT)
{
    min = minT;
    max = maxT;
}

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

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

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

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

template <class T>
inline void
Box<Vec2<T> >::extendBy (const Vec2<T> &point)
{
    if (point[0] < min[0])
        min[0] = point[0];

if (point[0] > max[0])
        max[0] = point[0];

if (point[1] < min[1])
        min[1] = point[1];

if (point[1] > max[1])
        max[1] = point[1];
}

template <class T>
inline void
Box<Vec2<T> >::extendBy (const Box<Vec2<T> > &box)
{
    if (box.min[0] < min[0])
        min[0] = box.min[0];

if (box.max[0] > max[0])
        max[0] = box.max[0];

if (box.min[1] < min[1])
        min[1] = box.min[1];

if (box.max[1] > max[1])
        max[1] = box.max[1];
}

template <class T>
inline bool
Box<Vec2<T> >::intersects (const Vec2<T> &point) const
{
    if (point[0] < min[0] || point[0] > max[0] ||
        point[1] < min[1] || point[1] > max[1])
        return false;

return true;
}

template <class T>
inline bool
Box<Vec2<T> >::intersects (const Box<Vec2<T> > &box) const
{
    if (box.max[0] < min[0] || box.min[0] > max[0] ||
        box.max[1] < min[1] || box.min[1] > max[1])
        return false;

return true;
}

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

return max - min;
}

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

template <class T>
inline bool
Box<Vec2<T> >::isEmpty() const
{
    if (max[0] < min[0] ||
        max[1] < min[1])
        return true;

return false;
}

template <class T>
inline bool
Box<Vec2<T> > ::isInfinite() const
{
    if (min[0] != limits<T>::min() || max[0] != limits<T>::max() ||
        min[1] != limits<T>::min() || max[1] != limits<T>::max())
        return false;
    
    return true;
}

template <class T>
inline bool
Box<Vec2<T> >::hasVolume() const
{
    if (max[0] <= min[0] ||
        max[1] <= min[1])
        return false;

return true;
}

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

if (s[1] > s[major])
        major = 1;

return major;
}

template <class T>
class Box<Vec3<T> >
{
  public:

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

Vec3<T>			min;
    Vec3<T>			max;

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

Box(); 
    Box (const Vec3<T> &point);
    Box (const Vec3<T> &minT, const Vec3<T> &maxT);

//--------------------
    //  Operators:  ==, !=
    //--------------------

bool		operator == (const Box<Vec3<T> > &src) const;
    bool		operator != (const Box<Vec3<T> > &src) const;

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

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

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

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

unsigned int	majorAxis() const;

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

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

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

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

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

template <class T>
inline Box<Vec3<T> >::Box (const Vec3<T> &minT, const Vec3<T> &maxT)
{
    min = minT;
    max = maxT;
}

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

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

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

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

template <class T>
inline void
Box<Vec3<T> >::extendBy (const Vec3<T> &point)
{
    if (point[0] < min[0])
        min[0] = point[0];

if (point[0] > max[0])
        max[0] = point[0];

if (point[1] < min[1])
        min[1] = point[1];

if (point[1] > max[1])
        max[1] = point[1];

if (point[2] < min[2])
        min[2] = point[2];

if (point[2] > max[2])
        max[2] = point[2];
}

template <class T>
inline void
Box<Vec3<T> >::extendBy (const Box<Vec3<T> > &box)
{
    if (box.min[0] < min[0])
        min[0] = box.min[0];

if (box.max[0] > max[0])
        max[0] = box.max[0];

if (box.min[1] < min[1])
        min[1] = box.min[1];

if (box.max[1] > max[1])
        max[1] = box.max[1];

if (box.min[2] < min[2])
        min[2] = box.min[2];

if (box.max[2] > max[2])
        max[2] = box.max[2];
}

template <class T>
inline bool
Box<Vec3<T> >::intersects (const Vec3<T> &point) const
{
    if (point[0] < min[0] || point[0] > max[0] ||
        point[1] < min[1] || point[1] > max[1] ||
        point[2] < min[2] || point[2] > max[2])
        return false;

return true;
}

template <class T>
inline bool
Box<Vec3<T> >::intersects (const Box<Vec3<T> > &box) const
{
    if (box.max[0] < min[0] || box.min[0] > max[0] ||
        box.max[1] < min[1] || box.min[1] > max[1] ||
        box.max[2] < min[2] || box.min[2] > max[2])
        return false;

return true;
}

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

return max - min;
}

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

template <class T>
inline bool
Box<Vec3<T> >::isEmpty() const
{
    if (max[0] < min[0] ||
        max[1] < min[1] ||
        max[2] < min[2])
        return true;

return false;
}

template <class T>
inline bool
Box<Vec3<T> >::isInfinite() const
{
    if (min[0] != limits<T>::min() || max[0] != limits<T>::max() ||
        min[1] != limits<T>::min() || max[1] != limits<T>::max() ||
        min[2] != limits<T>::min() || max[2] != limits<T>::max())
        return false;
    
    return true;
}

template <class T>
inline bool
Box<Vec3<T> >::hasVolume() const
{
    if (max[0] <= min[0] ||
        max[1] <= min[1] ||
        max[2] <= min[2])
        return false;

return true;
}

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

if (s[1] > s[major])
        major = 1;

if (s[2] > s[major])
        major = 2;

return major;
}

IMATH_INTERNAL_NAMESPACE_HEADER_EXIT

#endif // INCLUDED_IMATHBOX_H

${this.title}

Code Editor : ImathBox.h