113 lines
4.0 KiB
C++
113 lines
4.0 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 _PyImathEuler_h_
|
|
#define _PyImathEuler_h_
|
|
|
|
#include <Python.h>
|
|
#include <boost/python.hpp>
|
|
#include <PyImath.h>
|
|
#include <ImathEuler.h>
|
|
#include <ImathVec.h>
|
|
#include <PyImath.h>
|
|
|
|
namespace PyImath {
|
|
|
|
template <class T> boost::python::class_<IMATH_NAMESPACE::Euler<T>,boost::python::bases<IMATH_NAMESPACE::Vec3<T> > > register_Euler();
|
|
template <class T> boost::python::class_<PyImath::FixedArray<IMATH_NAMESPACE::Euler<T> > > register_EulerArray();
|
|
typedef FixedArray<IMATH_NAMESPACE::Eulerf> EulerfArray;
|
|
typedef FixedArray<IMATH_NAMESPACE::Eulerd> EulerdArray;
|
|
|
|
//
|
|
|
|
// Other code in the Zeno code base assumes the existance of a class with the
|
|
// same name as the Imath class, and with static functions wrap() and
|
|
// convert() to produce a PyImath object from an Imath object and vice-versa,
|
|
// respectively. The class Boost generates from the Imath class does not
|
|
// have these properties, so we define a companion class here.
|
|
// The template argument, T, is the element type for the axis vector
|
|
// (e.g.,float, double).
|
|
|
|
template <class T>
|
|
class E {
|
|
public:
|
|
static PyObject * wrap (const IMATH_NAMESPACE::Euler<T> &e);
|
|
static int convert (PyObject *p, IMATH_NAMESPACE::Euler<T> *v);
|
|
};
|
|
|
|
template <class T>
|
|
PyObject *
|
|
E<T>::wrap (const IMATH_NAMESPACE::Euler<T> &e)
|
|
{
|
|
typename boost::python::return_by_value::apply < IMATH_NAMESPACE::Euler<T> >::type converter;
|
|
PyObject *p = converter (e);
|
|
return p;
|
|
}
|
|
|
|
template <class T>
|
|
int
|
|
E<T>::convert (PyObject *p, IMATH_NAMESPACE::Euler<T> *v)
|
|
{
|
|
boost::python::extract <IMATH_NAMESPACE::Eulerf> extractorEf (p);
|
|
if (extractorEf.check())
|
|
{
|
|
IMATH_NAMESPACE::Eulerf e = extractorEf();
|
|
v->x = T(e.x);
|
|
v->y = T(e.y);
|
|
v->z = T(e.z);
|
|
v->setOrder (typename IMATH_NAMESPACE::Euler<T>::Order (e.order()));
|
|
return 1;
|
|
}
|
|
|
|
boost::python::extract <IMATH_NAMESPACE::Eulerd> extractorEd (p);
|
|
if (extractorEd.check())
|
|
{
|
|
IMATH_NAMESPACE::Eulerd e = extractorEd();
|
|
v->x = T(e.x);
|
|
v->y = T(e.y);
|
|
v->z = T(e.z);
|
|
v->setOrder (typename IMATH_NAMESPACE::Euler<T>::Order (e.order()));
|
|
return 1;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
typedef E<float> Eulerf;
|
|
typedef E<double> Eulerd;
|
|
|
|
}
|
|
|
|
#endif
|