Alexander Kuznetsov
e2429d6492
Changes for VC2013 Now, I can build Blender with VC2013 with Cycles, Collada, OpenExr,OpenImageIO disabled. Also, you need VC2008 sp1 installed to make old libs compatible.
167 lines
3.3 KiB
C++
167 lines
3.3 KiB
C++
/*
|
|
* ***** BEGIN GPL LICENSE BLOCK *****
|
|
*
|
|
* This program 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.
|
|
*
|
|
* This program 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 this program; if not, write to the Free Software Foundation,
|
|
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
*
|
|
* ***** END GPL LICENSE BLOCK *****
|
|
*/
|
|
|
|
#ifndef __BBOX_H__
|
|
#define __BBOX_H__
|
|
|
|
/** \file blender/freestyle/intern/geometry/BBox.h
|
|
* \ingroup freestyle
|
|
* \brief A class to hold a bounding box
|
|
* \author Stephane Grabli
|
|
* \date 22/05/2003
|
|
*/
|
|
|
|
#include <stdlib.h>
|
|
#include <algorithm>
|
|
|
|
#include "BLI_utildefines.h"
|
|
|
|
#ifdef WITH_CXX_GUARDEDALLOC
|
|
#include "MEM_guardedalloc.h"
|
|
#endif
|
|
|
|
namespace Freestyle {
|
|
|
|
template <class Point>
|
|
class BBox
|
|
{
|
|
public:
|
|
inline BBox()
|
|
{
|
|
_empty = true;
|
|
}
|
|
|
|
template <class T>
|
|
inline BBox(const T& min_in, const T& max_in) : _min(min_in), _max(max_in)
|
|
{
|
|
_empty = false;
|
|
}
|
|
|
|
template <class T>
|
|
inline BBox(const BBox<T>& b) : _min(b.getMin()), _max(b.getMax())
|
|
{
|
|
_empty = false;
|
|
}
|
|
|
|
template <class T>
|
|
inline void extendToContain(const T& p)
|
|
{
|
|
if (_empty) {
|
|
_min = p;
|
|
_max = p;
|
|
_empty = false;
|
|
return;
|
|
}
|
|
for (unsigned int i = 0; i < Point::dim(); i++) {
|
|
if (p[i] < _min[i])
|
|
_min[i] = p[i];
|
|
else if (p[i] > _max[i])
|
|
_max[i] = p[i];
|
|
}
|
|
_empty = false;
|
|
}
|
|
|
|
inline void clear()
|
|
{
|
|
_empty = true;
|
|
}
|
|
|
|
inline bool empty() const
|
|
{
|
|
return _empty;
|
|
}
|
|
|
|
inline const Point& getMin() const
|
|
{
|
|
return _min;
|
|
}
|
|
|
|
inline const Point& getMax() const
|
|
{
|
|
return _max;
|
|
}
|
|
|
|
inline BBox<Point>& operator=(const BBox<Point>& b)
|
|
{
|
|
BLI_assert(!b.empty());
|
|
_min = b.getMin();
|
|
_max = b.getMax();
|
|
_empty = false;
|
|
return *this;
|
|
}
|
|
|
|
inline BBox<Point>& operator+=(const BBox<Point>& b)
|
|
{
|
|
BLI_assert(!b.empty());
|
|
if (_empty) {
|
|
_min = b.getMin();
|
|
_max = b.getMax();
|
|
_empty = false;
|
|
}
|
|
else {
|
|
for (unsigned int i = 0; i < Point::dim(); i++) {
|
|
if (b.getMin()[i] < _min[i])
|
|
_min[i] = b.getMin()[i];
|
|
if (b.getMax()[i] > _max[i])
|
|
_max[i] = b.getMax()[i];
|
|
}
|
|
}
|
|
return *this;
|
|
}
|
|
|
|
inline bool inside(const Point& p)
|
|
{
|
|
if (empty())
|
|
return false;
|
|
for (unsigned int i = 0; i < Point::dim(); i++) {
|
|
if ((_min[i]>p[i]) || (_max[i]<p[i]))
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
private:
|
|
Point _min;
|
|
Point _max;
|
|
bool _empty;
|
|
|
|
#ifdef WITH_CXX_GUARDEDALLOC
|
|
MEM_CXX_CLASS_ALLOC_FUNCS("Freestyle:BBox")
|
|
#endif
|
|
};
|
|
|
|
template <class Point>
|
|
BBox<Point>& operator+(const BBox<Point> &b1, const BBox<Point> &b2)
|
|
{
|
|
Point new_min;
|
|
Point new_max;
|
|
|
|
for (unsigned int i = 0; i < Point::dim(); i++) {
|
|
new_min[i] = b1.getMin()[i] < b2.getMin()[i] ? b1.getMin()[i] : b2.getMin()[i];
|
|
new_max[i] = b1.getMax()[i] > b2.getMax()[i] ? b1.getMax()[i] : b2.getMax()[i];
|
|
}
|
|
|
|
return BBox<Point>(new_min, new_max);
|
|
}
|
|
|
|
} /* namespace Freestyle */
|
|
|
|
#endif // __BBOX_H__
|