188 lines
7.1 KiB
C
188 lines
7.1 KiB
C
|
///////////////////////////////////////////////////////////////////////////
|
||
|
|
//
|
||
|
|
// Copyright (c) 1998-2011, 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 _PyImathVec3ArrayImpl_h_
|
||
|
|
#define _PyImathVec3ArrayImpl_h_
|
||
|
|
|
||
|
|
//
|
||
|
|
// This .C file was turned into a header file so that instantiations
|
||
|
|
// of the various V3* types can be spread across multiple files in
|
||
|
|
// order to work around MSVC limitations.
|
||
|
|
//
|
||
|
|
|
||
|
|
#include <PyImathVec.h>
|
||
|
|
#include "PyImathDecorators.h"
|
||
|
|
#include <Python.h>
|
||
|
|
#include <boost/python.hpp>
|
||
|
|
#include <boost/python/make_constructor.hpp>
|
||
|
|
#include <boost/format.hpp>
|
||
|
|
#include <PyImath.h>
|
||
|
|
#include <PyImathBox.h>
|
||
|
|
#include <ImathVec.h>
|
||
|
|
#include <ImathVecAlgo.h>
|
||
|
|
#include <Iex.h>
|
||
|
|
#include <PyImathMathExc.h>
|
||
|
|
#include <PyImathOperators.h>
|
||
|
|
#include <PyImathVecOperators.h>
|
||
|
|
|
||
|
|
namespace PyImath {
|
||
|
|
using namespace boost::python;
|
||
|
|
using namespace IMATH_NAMESPACE;
|
||
|
|
|
||
|
|
// XXX fixme - template this
|
||
|
|
// really this should get generated automatically...
|
||
|
|
|
||
|
|
template <class T,int index>
|
||
|
|
static FixedArray<T>
|
||
|
|
Vec3Array_get(FixedArray<IMATH_NAMESPACE::Vec3<T> > &va)
|
||
|
|
{
|
||
|
|
return FixedArray<T>(&va[0][index],va.len(),3*va.stride(),va.handle());
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T>
|
||
|
|
static void
|
||
|
|
setItemTuple(FixedArray<IMATH_NAMESPACE::Vec3<T> > &va, Py_ssize_t index, const tuple &t)
|
||
|
|
{
|
||
|
|
if(t.attr("__len__")() == 3)
|
||
|
|
{
|
||
|
|
Vec3<T> v;
|
||
|
|
v.x = extract<T>(t[0]);
|
||
|
|
v.y = extract<T>(t[1]);
|
||
|
|
v.z = extract<T>(t[2]);
|
||
|
|
va[va.canonical_index(index)] = v;
|
||
|
|
}
|
||
|
|
else
|
||
|
|
THROW(IEX_NAMESPACE::LogicExc, "tuple of length 3 expected");
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T>
|
||
|
|
static IMATH_NAMESPACE::Vec3<T>
|
||
|
|
Vec3Array_min(const FixedArray<IMATH_NAMESPACE::Vec3<T> > &a)
|
||
|
|
{
|
||
|
|
Vec3<T> tmp(Vec3<T>(0));
|
||
|
|
size_t len = a.len();
|
||
|
|
if (len > 0)
|
||
|
|
tmp = a[0];
|
||
|
|
for (size_t i=1; i < len; ++i)
|
||
|
|
{
|
||
|
|
if (a[i].x < tmp.x)
|
||
|
|
tmp.x = a[i].x;
|
||
|
|
if (a[i].y < tmp.y)
|
||
|
|
tmp.y = a[i].y;
|
||
|
|
if (a[i].z < tmp.z)
|
||
|
|
tmp.z = a[i].z;
|
||
|
|
}
|
||
|
|
return tmp;
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T>
|
||
|
|
static IMATH_NAMESPACE::Vec3<T>
|
||
|
|
Vec3Array_max(const FixedArray<IMATH_NAMESPACE::Vec3<T> > &a)
|
||
|
|
{
|
||
|
|
Vec3<T> tmp(Vec3<T>(0));
|
||
|
|
size_t len = a.len();
|
||
|
|
if (len > 0)
|
||
|
|
tmp = a[0];
|
||
|
|
for (size_t i=1; i < len; ++i)
|
||
|
|
{
|
||
|
|
if (a[i].x > tmp.x)
|
||
|
|
tmp.x = a[i].x;
|
||
|
|
if (a[i].y > tmp.y)
|
||
|
|
tmp.y = a[i].y;
|
||
|
|
if (a[i].z > tmp.z)
|
||
|
|
tmp.z = a[i].z;
|
||
|
|
}
|
||
|
|
return tmp;
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T>
|
||
|
|
static IMATH_NAMESPACE::Box<IMATH_NAMESPACE::Vec3<T> >
|
||
|
|
Vec3Array_bounds(const FixedArray<IMATH_NAMESPACE::Vec3<T> > &a)
|
||
|
|
{
|
||
|
|
Box<Vec3<T> > tmp;
|
||
|
|
size_t len = a.len();
|
||
|
|
for (size_t i=0; i < len; ++i)
|
||
|
|
tmp.extendBy(a[i]);
|
||
|
|
return tmp;
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T>
|
||
|
|
class_<FixedArray<IMATH_NAMESPACE::Vec3<T> > >
|
||
|
|
register_Vec3Array()
|
||
|
|
{
|
||
|
|
using boost::mpl::true_;
|
||
|
|
using boost::mpl::false_;
|
||
|
|
|
||
|
|
class_<FixedArray<IMATH_NAMESPACE::Vec3<T> > > vec3Array_class = FixedArray<IMATH_NAMESPACE::Vec3<T> >::register_("Fixed length array of IMATH_NAMESPACE::Vec3");
|
||
|
|
vec3Array_class
|
||
|
|
.add_property("x",&Vec3Array_get<T,0>)
|
||
|
|
.add_property("y",&Vec3Array_get<T,1>)
|
||
|
|
.add_property("z",&Vec3Array_get<T,2>)
|
||
|
|
.def("__setitem__", &setItemTuple<T>)
|
||
|
|
.def("min", &Vec3Array_min<T>)
|
||
|
|
.def("max", &Vec3Array_max<T>)
|
||
|
|
.def("bounds", &Vec3Array_bounds<T>)
|
||
|
|
;
|
||
|
|
|
||
|
|
add_arithmetic_math_functions(vec3Array_class);
|
||
|
|
add_comparison_functions(vec3Array_class);
|
||
|
|
|
||
|
|
generate_member_bindings<op_vecLength<IMATH_NAMESPACE::Vec3<T> > >(vec3Array_class,"length","");
|
||
|
|
generate_member_bindings<op_vecLength2<IMATH_NAMESPACE::Vec3<T> > >(vec3Array_class,"length2","");
|
||
|
|
generate_member_bindings<op_vecNormalize<IMATH_NAMESPACE::Vec3<T> > >(vec3Array_class,"normalize","");
|
||
|
|
generate_member_bindings<op_vecNormalized<IMATH_NAMESPACE::Vec3<T> > >(vec3Array_class,"normalized","");
|
||
|
|
|
||
|
|
generate_member_bindings<op_vec3Cross<T>, true_>(vec3Array_class,"cross","return the cross product of (self,x)",boost::python::args("x"));
|
||
|
|
generate_member_bindings<op_vecDot<IMATH_NAMESPACE::Vec3<T> >,true_>(vec3Array_class,"dot","return the inner product of (self,x)",boost::python::args("x"));
|
||
|
|
|
||
|
|
generate_member_bindings<op_mul<IMATH_NAMESPACE::Vec3<T>,T>, true_>(vec3Array_class,"__mul__" ,"self*x", boost::python::args("x"));
|
||
|
|
generate_member_bindings<op_mul<IMATH_NAMESPACE::Vec3<T>,IMATH_NAMESPACE::M44f>,false_>(vec3Array_class,"__mul__" ,"self*x", boost::python::args("x"));
|
||
|
|
generate_member_bindings<op_mul<IMATH_NAMESPACE::Vec3<T>,IMATH_NAMESPACE::M44d>,false_>(vec3Array_class,"__mul__" ,"self*x", boost::python::args("x"));
|
||
|
|
|
||
|
|
generate_member_bindings<op_mul<IMATH_NAMESPACE::Vec3<T>,T>, true_>(vec3Array_class,"__rmul__","x*self", boost::python::args("x"));
|
||
|
|
generate_member_bindings<op_imul<IMATH_NAMESPACE::Vec3<T>,T>, true_>(vec3Array_class,"__imul__","self*=x",boost::python::args("x"));
|
||
|
|
generate_member_bindings<op_div<IMATH_NAMESPACE::Vec3<T>,T>, true_>(vec3Array_class,"__div__" ,"self/x", boost::python::args("x"));
|
||
|
|
generate_member_bindings<op_div<IMATH_NAMESPACE::Vec3<T>,T>, true_>(vec3Array_class,"__truediv__" ,"self/x", boost::python::args("x"));
|
||
|
|
generate_member_bindings<op_idiv<IMATH_NAMESPACE::Vec3<T>,T>, true_>(vec3Array_class,"__idiv__","self/=x",boost::python::args("x"));
|
||
|
|
generate_member_bindings<op_idiv<IMATH_NAMESPACE::Vec3<T>,T>, true_>(vec3Array_class,"__itruediv__","self/=x",boost::python::args("x"));
|
||
|
|
|
||
|
|
decoratecopy(vec3Array_class);
|
||
|
|
|
||
|
|
return vec3Array_class;
|
||
|
|
}
|
||
|
|
|
||
|
|
} // namespace PyImath
|
||
|
|
|
||
|
|
#endif // _PyImathVec3ArrayImpl_h_
|