|
@@ -3,225 +3,7 @@
|
|
|
|
|
|
#include "python.h"
|
|
|
|
|
|
-// template <typename Type> void init_fixed_from_buffer_3(Type &v, py::buffer &b) {
|
|
|
-// typedef typename Type::Scalar Scalar;
|
|
|
-//
|
|
|
-// py::buffer_info info = b.request();
|
|
|
-// if (info.format != py::format_descriptor<Scalar>::value())
|
|
|
-// throw std::runtime_error("Incompatible buffer format!");
|
|
|
-// if (!((info.ndim == 1 && info.strides[0] == sizeof(Scalar)) ||
|
|
|
-// (info.ndim == 2 &&
|
|
|
-// ((info.shape[0] == 1 && info.strides[0] == sizeof(Scalar) &&
|
|
|
-// info.shape[1] == 3) ||
|
|
|
-// (info.shape[1] == 1 && info.strides[1] == sizeof(Scalar) &&
|
|
|
-// info.shape[0] == 3)))))
|
|
|
-// throw std::runtime_error("Incompatible buffer dimension!");
|
|
|
-//
|
|
|
-// memcpy(v.data(), info.ptr, sizeof(Scalar) * 3);
|
|
|
-// }
|
|
|
-//
|
|
|
-// /// Creates Python bindings for an Eigen order-1 tensor of size 3 (i.e. a vector/normal/point)
|
|
|
-// template <typename Type>
|
|
|
-// py::class_<Type> bind_eigen_1_3(py::module &m, const char *name,
|
|
|
-// py::object parent = py::object()) {
|
|
|
-// typedef typename Type::Scalar Scalar;
|
|
|
-//
|
|
|
-// py::class_<Type> vector(m, name, parent);
|
|
|
-// vector
|
|
|
-// /* Constructors */
|
|
|
-// .def(py::init<>())
|
|
|
-// .def(py::init<Scalar>())
|
|
|
-// .def(py::init<Scalar, Scalar, Scalar>())
|
|
|
-// .def("__init__", [](Type &v, const std::vector<Scalar> &v2) {
|
|
|
-// if (v2.size() != 3)
|
|
|
-// throw std::runtime_error("Incompatible size!");
|
|
|
-// memcpy(v.data(), &v2[0], sizeof(Scalar) * 3);
|
|
|
-// })
|
|
|
-// .def("__init__", [](Type &v, py::buffer b) {
|
|
|
-// init_fixed_from_buffer_3(v, b);
|
|
|
-// })
|
|
|
-//
|
|
|
-// /* Initialization */
|
|
|
-// .def("setConstant", [](Type &m, Scalar value) { m.setConstant(value); })
|
|
|
-// .def("setZero", [](Type &m) { m.setZero(); })
|
|
|
-//
|
|
|
-// /* Arithmetic operators (def_cast forcefully casts the result back to a
|
|
|
-// Matrix to avoid type issues with Eigen's crazy expression templates) */
|
|
|
-// .def_cast(-py::self)
|
|
|
-// .def_cast(py::self + py::self)
|
|
|
-// .def_cast(py::self - py::self)
|
|
|
-// .def_cast(py::self * Scalar())
|
|
|
-// .def_cast(py::self / Scalar())
|
|
|
-// .def_cast(py::self += py::self)
|
|
|
-// .def_cast(py::self -= py::self)
|
|
|
-// .def_cast(py::self *= Scalar())
|
|
|
-// .def_cast(py::self /= Scalar())
|
|
|
-//
|
|
|
-// /* Comparison operators */
|
|
|
-// .def(py::self == py::self)
|
|
|
-// .def(py::self != py::self)
|
|
|
-//
|
|
|
-// /* Python protocol implementations */
|
|
|
-// .def("__len__", [](const Type &) { return (int) 3; })
|
|
|
-// .def("__repr__", [](const Type &v) {
|
|
|
-// std::ostringstream oss;
|
|
|
-// oss << v;
|
|
|
-// return oss.str();
|
|
|
-// })
|
|
|
-// .def("__getitem__", [](const Type &c, int i) {
|
|
|
-// if (i < 0 || i >= 3)
|
|
|
-// throw py::index_error();
|
|
|
-// return c[i];
|
|
|
-// })
|
|
|
-// .def("__setitem__", [](Type &c, int i, Scalar v) {
|
|
|
-// if (i < 0 || i >= 3)
|
|
|
-// throw py::index_error();
|
|
|
-// c[i] = v;
|
|
|
-// })
|
|
|
-//
|
|
|
-// /* Buffer access for interacting with NumPy */
|
|
|
-// .def_buffer([](Type &m) -> py::buffer_info {
|
|
|
-// return py::buffer_info(
|
|
|
-// m.data(), /* Pointer to buffer */
|
|
|
-// sizeof(Scalar), /* Size of one scalar */
|
|
|
-// /* Python struct-style format descriptor */
|
|
|
-// py::format_descriptor<Scalar>::value(),
|
|
|
-// 1, { (size_t) 3 },
|
|
|
-// { sizeof(Scalar) }
|
|
|
-// );
|
|
|
-// });
|
|
|
-// return vector;
|
|
|
-// }
|
|
|
-//
|
|
|
-// /// Creates Python bindings for a dynamic Eigen order-1 tensor (i.e. a vector)
|
|
|
-// template <typename Type>
|
|
|
-// py::class_<Type> bind_eigen_1(py::module &m, const char *name,
|
|
|
-// py::object parent = py::object()) {
|
|
|
-// typedef typename Type::Scalar Scalar;
|
|
|
-//
|
|
|
-// /* Many Eigen functions are templated and can't easily be referenced using
|
|
|
-// a function pointer, thus a big portion of the binding code below
|
|
|
-// instantiates Eigen code using small anonymous wrapper functions */
|
|
|
-// py::class_<Type> vector(m, name, parent);
|
|
|
-//
|
|
|
-// vector
|
|
|
-// /* Constructors */
|
|
|
-// .def(py::init<>())
|
|
|
-// .def(py::init<size_t>())
|
|
|
-// .def("__init__", [](Type &v, const std::vector<Scalar> &v2) {
|
|
|
-// new (&v) Type(v2.size());
|
|
|
-// memcpy(v.data(), &v2[0], sizeof(Scalar) * v2.size());
|
|
|
-// })
|
|
|
-// .def("__init__", [](Type &v, py::buffer b) {
|
|
|
-// py::buffer_info info = b.request();
|
|
|
-// if (info.format != py::format_descriptor<Scalar>::value()) {
|
|
|
-// throw std::runtime_error("Incompatible buffer format!");
|
|
|
-// } else if (info.ndim == 1 && info.strides[0] == sizeof(Scalar)) {
|
|
|
-// new (&v) Type(info.shape[0]);
|
|
|
-// memcpy(v.data(), info.ptr, sizeof(Scalar) * info.shape[0]);
|
|
|
-// } else if (info.ndim == 2 && ((info.shape[0] == 1 && info.strides[0] == sizeof(Scalar))
|
|
|
-// || (info.shape[1] == 1 && info.strides[1] == sizeof(Scalar)))) {
|
|
|
-// new (&v) Type(info.shape[0] * info.shape[1]);
|
|
|
-// memcpy(v.data(), info.ptr, sizeof(Scalar) * info.shape[0] * info.shape[1]);
|
|
|
-// } else {
|
|
|
-// throw std::runtime_error("Incompatible buffer dimension!");
|
|
|
-// }
|
|
|
-// })
|
|
|
-//
|
|
|
-// /* Size query functions */
|
|
|
-// .def("size", [](const Type &m) { return m.size(); })
|
|
|
-// .def("cols", [](const Type &m) { return m.cols(); })
|
|
|
-// .def("rows", [](const Type &m) { return m.rows(); })
|
|
|
-//
|
|
|
-// /* Initialization */
|
|
|
-// .def("setZero", [](Type &m) { m.setZero(); })
|
|
|
-// .def("setConstant", [](Type &m, Scalar value) { m.setConstant(value); })
|
|
|
-//
|
|
|
-// /* Resizing */
|
|
|
-// .def("resize", [](Type &m, size_t s0) { m.resize(s0); })
|
|
|
-// .def("resizeLike", [](Type &m, const Type &m2) { m.resizeLike(m2); })
|
|
|
-// .def("conservativeResize", [](Type &m, size_t s0) { m.conservativeResize(s0); })
|
|
|
-//
|
|
|
-// /* Component-wise operations */
|
|
|
-// .def("cwiseAbs", &Type::cwiseAbs)
|
|
|
-// .def("cwiseAbs2", &Type::cwiseAbs2)
|
|
|
-// .def("cwiseSqrt", &Type::cwiseSqrt)
|
|
|
-// .def("cwiseInverse", &Type::cwiseInverse)
|
|
|
-// .def("cwiseMin", [](const Type &m1, const Type &m2) -> Type { return m1.cwiseMin(m2); })
|
|
|
-// .def("cwiseMax", [](const Type &m1, const Type &m2) -> Type { return m1.cwiseMax(m2); })
|
|
|
-// .def("cwiseMin", [](const Type &m1, Scalar s) -> Type { return m1.cwiseMin(s); })
|
|
|
-// .def("cwiseMax", [](const Type &m1, Scalar s) -> Type { return m1.cwiseMax(s); })
|
|
|
-// .def("cwiseProduct", [](const Type &m1, const Type &m2) -> Type { return m1.cwiseProduct(m2); })
|
|
|
-// .def("cwiseQuotient", [](const Type &m1, const Type &m2) -> Type { return m1.cwiseQuotient(m2); })
|
|
|
-//
|
|
|
-// /* Arithmetic operators (def_cast forcefully casts the result back to a
|
|
|
-// Type to avoid type issues with Eigen's crazy expression templates) */
|
|
|
-// .def_cast(-py::self)
|
|
|
-// .def_cast(py::self + py::self)
|
|
|
-// .def_cast(py::self - py::self)
|
|
|
-// .def_cast(py::self * Scalar())
|
|
|
-// .def_cast(py::self / Scalar())
|
|
|
-//
|
|
|
-// .def("__rmul__", [](const Type& a, const Scalar& b)
|
|
|
-// {
|
|
|
-// return Type(b * a);
|
|
|
-// })
|
|
|
-//
|
|
|
-//
|
|
|
-// /* Arithmetic in-place operators */
|
|
|
-// .def_cast(py::self += py::self)
|
|
|
-// .def_cast(py::self -= py::self)
|
|
|
-// .def_cast(py::self *= py::self)
|
|
|
-// .def_cast(py::self *= Scalar())
|
|
|
-// .def_cast(py::self /= Scalar())
|
|
|
-//
|
|
|
-// /* Comparison operators */
|
|
|
-// .def(py::self == py::self)
|
|
|
-// .def(py::self != py::self)
|
|
|
-//
|
|
|
-// /* Python protocol implementations */
|
|
|
-// .def("__repr__", [](const Type &v) {
|
|
|
-// std::ostringstream oss;
|
|
|
-// oss << v.transpose();
|
|
|
-// return oss.str();
|
|
|
-// })
|
|
|
-// .def("__getitem__", [](const Type &m, size_t i) {
|
|
|
-// if (i >= (size_t) m.size())
|
|
|
-// throw py::index_error();
|
|
|
-// return m[i];
|
|
|
-// })
|
|
|
-// .def("__setitem__", [](Type &m, size_t i, Scalar v) {
|
|
|
-// if (i >= (size_t) m.size())
|
|
|
-// throw py::index_error();
|
|
|
-// m[i] = v;
|
|
|
-// })
|
|
|
-//
|
|
|
-// /* Buffer access for interacting with NumPy */
|
|
|
-// .def_buffer([](Type &m) -> py::buffer_info {
|
|
|
-// return py::buffer_info(
|
|
|
-// m.data(), /* Pointer to buffer */
|
|
|
-// sizeof(Scalar), /* Size of one scalar */
|
|
|
-// /* Python struct-style format descriptor */
|
|
|
-// py::format_descriptor<Scalar>::value(),
|
|
|
-// 1, /* Number of dimensions */
|
|
|
-// { (size_t) m.size() }, /* Buffer dimensions */
|
|
|
-// { sizeof(Scalar) } /* Strides (in bytes) for each index */
|
|
|
-// );
|
|
|
-// })
|
|
|
-//
|
|
|
-// /* Static initializers */
|
|
|
-// .def_static("Zero", [](size_t n) { return Type(Type::Zero(n)); })
|
|
|
-// .def_static("Ones", [](size_t n) { return Type(Type::Ones(n)); })
|
|
|
-// .def_static("Constant", [](size_t n, Scalar value) { return Type(Type::Constant(n, value)); })
|
|
|
-// .def("MapMatrix", [](const Type& m, size_t r, size_t c)
|
|
|
-// {
|
|
|
-// return Eigen::Matrix<Scalar,Eigen::Dynamic,Eigen::Dynamic>(Eigen::Map<const Eigen::Matrix<Scalar,Eigen::Dynamic,Eigen::Dynamic>>(m.data(),r,c));
|
|
|
-// })
|
|
|
-// ;
|
|
|
-// return vector;
|
|
|
-// }
|
|
|
-
|
|
|
-/// Creates Python bindings for a dynamic Eigen order-2 tensor (i.e. a matrix)
|
|
|
+/// Creates Python bindings for a dynamic Eigen matrix
|
|
|
template <typename Type>
|
|
|
py::class_<Type> bind_eigen_2(py::module &m, const char *name,
|
|
|
py::object parent = py::object()) {
|
|
@@ -322,20 +104,58 @@ py::class_<Type> bind_eigen_2(py::module &m, const char *name,
|
|
|
.def_cast(py::self + py::self)
|
|
|
.def_cast(py::self - py::self)
|
|
|
.def_cast(py::self * py::self)
|
|
|
- .def_cast(py::self * Scalar())
|
|
|
- .def_cast(py::self / Scalar())
|
|
|
+ // .def_cast(py::self - Scalar())
|
|
|
+ // .def_cast(py::self * Scalar())
|
|
|
+ // .def_cast(py::self / Scalar())
|
|
|
|
|
|
+ .def("__mul__", []
|
|
|
+ (const Type &a, const Scalar& b)
|
|
|
+ {
|
|
|
+ return Eigen::Matrix<Scalar,Eigen::Dynamic,Eigen::Dynamic>(a * b);
|
|
|
+ })
|
|
|
.def("__rmul__", [](const Type& a, const Scalar& b)
|
|
|
{
|
|
|
return Eigen::Matrix<Scalar,Eigen::Dynamic,Eigen::Dynamic>(b * a);
|
|
|
})
|
|
|
|
|
|
+ .def("__add__", []
|
|
|
+ (const Type &a, const Scalar& b)
|
|
|
+ {
|
|
|
+ return Eigen::Matrix<Scalar,Eigen::Dynamic,Eigen::Dynamic>(a.array() + b);
|
|
|
+ })
|
|
|
+ .def("__radd__", [](const Type& a, const Scalar& b)
|
|
|
+ {
|
|
|
+ return Eigen::Matrix<Scalar,Eigen::Dynamic,Eigen::Dynamic>(b + a.array());
|
|
|
+ })
|
|
|
+
|
|
|
+ .def("__sub__", []
|
|
|
+ (const Type &a, const Scalar& b)
|
|
|
+ {
|
|
|
+ return Eigen::Matrix<Scalar,Eigen::Dynamic,Eigen::Dynamic>(a.array() - b);
|
|
|
+ })
|
|
|
+ .def("__rsub__", [](const Type& a, const Scalar& b)
|
|
|
+ {
|
|
|
+ return Eigen::Matrix<Scalar,Eigen::Dynamic,Eigen::Dynamic>(b - a.array());
|
|
|
+ })
|
|
|
+
|
|
|
+ .def("__div__", []
|
|
|
+ (const Type &a, const Scalar& b)
|
|
|
+ {
|
|
|
+ return Eigen::Matrix<Scalar,Eigen::Dynamic,Eigen::Dynamic>(a / b);
|
|
|
+ })
|
|
|
+
|
|
|
+ .def("__truediv__", []
|
|
|
+ (const Type &a, const Scalar& b)
|
|
|
+ {
|
|
|
+ return Eigen::Matrix<Scalar,Eigen::Dynamic,Eigen::Dynamic>(a / b);
|
|
|
+ })
|
|
|
+
|
|
|
/* Arithmetic in-place operators */
|
|
|
.def_cast(py::self += py::self)
|
|
|
.def_cast(py::self -= py::self)
|
|
|
.def_cast(py::self *= py::self)
|
|
|
- .def_cast(py::self *= Scalar())
|
|
|
- .def_cast(py::self /= Scalar())
|
|
|
+ // .def_cast(py::self *= Scalar())
|
|
|
+ // .def_cast(py::self /= Scalar())
|
|
|
|
|
|
/* Comparison operators */
|
|
|
.def(py::self == py::self)
|
|
@@ -473,19 +293,9 @@ py::class_<Type> bind_eigen_sparse_2(py::module &m, const char *name,
|
|
|
{
|
|
|
return Eigen::Matrix<Scalar,Eigen::Dynamic,Eigen::Dynamic>(b * a);
|
|
|
})
|
|
|
- // Special case, sparse * dense vector produces a dense vector
|
|
|
- .def("__mul__", []
|
|
|
- (const Type &a, const Eigen::Matrix<Scalar,Eigen::Dynamic,1>& b)
|
|
|
- {
|
|
|
- return Eigen::Matrix<Scalar,Eigen::Dynamic,1>(a * b);
|
|
|
- })
|
|
|
- .def("__rmul__", [](const Type& a, const Eigen::Matrix<Scalar,1,Eigen::Dynamic>& b)
|
|
|
- {
|
|
|
- return Eigen::Matrix<Scalar,1,Eigen::Dynamic>(b * a);
|
|
|
- })
|
|
|
|
|
|
//.def(py::self * Eigen::Matrix<Scalar,Eigen::Dynamic,Eigen::Dynamic>())
|
|
|
- .def_cast(py::self / Scalar())
|
|
|
+// .def_cast(py::self / Scalar())
|
|
|
|
|
|
/* Arithmetic in-place operators */
|
|
|
// .def_cast(py::self += py::self)
|
|
@@ -589,18 +399,18 @@ void python_export_vector(py::module &m) {
|
|
|
|
|
|
/* Bindings for MatrixXd */
|
|
|
bind_eigen_2<Eigen::MatrixXd> (me, "MatrixXd");
|
|
|
- py::implicitly_convertible<py::buffer, Eigen::MatrixXd>();
|
|
|
- py::implicitly_convertible<double, Eigen::MatrixXd>();
|
|
|
+ //py::implicitly_convertible<py::buffer, Eigen::MatrixXd>();
|
|
|
+ //py::implicitly_convertible<double, Eigen::MatrixXd>();
|
|
|
|
|
|
/* Bindings for MatrixXi */
|
|
|
bind_eigen_2<Eigen::MatrixXi> (me, "MatrixXi");
|
|
|
- py::implicitly_convertible<py::buffer, Eigen::MatrixXi>();
|
|
|
- py::implicitly_convertible<double, Eigen::MatrixXi>();
|
|
|
+// py::implicitly_convertible<py::buffer, Eigen::MatrixXi>();
|
|
|
+ //py::implicitly_convertible<double, Eigen::MatrixXi>();
|
|
|
|
|
|
/* Bindings for MatrixXuc */
|
|
|
bind_eigen_2<Eigen::Matrix<unsigned char,Eigen::Dynamic,Eigen::Dynamic> > (me, "MatrixXuc");
|
|
|
- py::implicitly_convertible<py::buffer, Eigen::Matrix<unsigned char,Eigen::Dynamic,Eigen::Dynamic> >();
|
|
|
- py::implicitly_convertible<double, Eigen::Matrix<unsigned char,Eigen::Dynamic,Eigen::Dynamic> >();
|
|
|
+ // py::implicitly_convertible<py::buffer, Eigen::Matrix<unsigned char,Eigen::Dynamic,Eigen::Dynamic> >();
|
|
|
+ // py::implicitly_convertible<double, Eigen::Matrix<unsigned char,Eigen::Dynamic,Eigen::Dynamic> >();
|
|
|
|
|
|
// /* Bindings for Vector3d */
|
|
|
// auto vector3 = bind_eigen_1_3<Eigen::Vector3d>(me, "Vector3d");
|