blob: 413fed3435ed168eedde948766e958fccb64d8f3 [file] [log] [blame]
Wenzel Jakob9e0a0562016-05-05 20:33:54 +02001/*
Dean Moldovana0c1ccf2016-08-12 13:50:00 +02002 tests/eigen.cpp -- automatic conversion of Eigen types
Wenzel Jakob9e0a0562016-05-05 20:33:54 +02003
4 Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
5
6 All rights reserved. Use of this source code is governed by a
7 BSD-style license that can be found in the LICENSE file.
8*/
9
Dean Moldovana0c1ccf2016-08-12 13:50:00 +020010#include "pybind11_tests.h"
Jason Rhinelander17d02832017-01-16 20:35:14 -050011#include "constructor_stats.h"
Wenzel Jakob9e0a0562016-05-05 20:33:54 +020012#include <pybind11/eigen.h>
Dean Moldovan30f6c3b2017-06-26 23:20:39 +020013#include <pybind11/stl.h>
Jason Rhinelander5fd50742016-08-03 16:50:22 -040014#include <Eigen/Cholesky>
Wenzel Jakob9e0a0562016-05-05 20:33:54 +020015
Jason Rhinelander17d02832017-01-16 20:35:14 -050016using MatrixXdR = Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic, Eigen::RowMajor>;
Ben Northb063e642016-07-05 20:01:11 +010017
Ben Northb063e642016-07-05 20:01:11 +010018
Ben North3e0e7792016-07-05 21:00:05 +010019
Jason Rhinelander17d02832017-01-16 20:35:14 -050020// Sets/resets a testing reference matrix to have values of 10*r + c, where r and c are the
21// (1-based) row/column number.
22template <typename M> void reset_ref(M &x) {
23 for (int i = 0; i < x.rows(); i++) for (int j = 0; j < x.cols(); j++)
24 x(i, j) = 11 + 10*i + j;
25}
Jason Rhinelander5fd50742016-08-03 16:50:22 -040026
Jason Rhinelander17d02832017-01-16 20:35:14 -050027// Returns a static, column-major matrix
28Eigen::MatrixXd &get_cm() {
29 static Eigen::MatrixXd *x;
30 if (!x) {
31 x = new Eigen::MatrixXd(3, 3);
32 reset_ref(*x);
33 }
34 return *x;
35}
36// Likewise, but row-major
37MatrixXdR &get_rm() {
38 static MatrixXdR *x;
39 if (!x) {
40 x = new MatrixXdR(3, 3);
41 reset_ref(*x);
42 }
43 return *x;
44}
45// Resets the values of the static matrices returned by get_cm()/get_rm()
46void reset_refs() {
47 reset_ref(get_cm());
48 reset_ref(get_rm());
49}
50
51// Returns element 2,1 from a matrix (used to test copy/nocopy)
52double get_elem(Eigen::Ref<const Eigen::MatrixXd> m) { return m(2, 1); };
Ben North3e0e7792016-07-05 21:00:05 +010053
Jason Rhinelanderefa87262017-03-17 14:51:52 -030054
55// Returns a matrix with 10*r + 100*c added to each matrix element (to help test that the matrix
56// reference is referencing rows/columns correctly).
57template <typename MatrixArgType> Eigen::MatrixXd adjust_matrix(MatrixArgType m) {
58 Eigen::MatrixXd ret(m);
59 for (int c = 0; c < m.cols(); c++) for (int r = 0; r < m.rows(); r++)
60 ret(r, c) += 10*r + 100*c;
61 return ret;
62}
63
Dean Moldovan0d765f42017-03-21 01:15:20 +010064struct CustomOperatorNew {
65 CustomOperatorNew() = default;
66
67 Eigen::Matrix4d a = Eigen::Matrix4d::Zero();
68 Eigen::Matrix4d b = Eigen::Matrix4d::Identity();
69
70 EIGEN_MAKE_ALIGNED_OPERATOR_NEW;
71};
72
Jason Rhinelander52f4be82016-09-03 14:54:22 -040073test_initializer eigen([](py::module &m) {
Wenzel Jakob9e0a0562016-05-05 20:33:54 +020074 typedef Eigen::Matrix<float, 5, 6, Eigen::RowMajor> FixedMatrixR;
75 typedef Eigen::Matrix<float, 5, 6> FixedMatrixC;
76 typedef Eigen::Matrix<float, Eigen::Dynamic, Eigen::Dynamic, Eigen::RowMajor> DenseMatrixR;
77 typedef Eigen::Matrix<float, Eigen::Dynamic, Eigen::Dynamic> DenseMatrixC;
Jason Rhinelanderd9d224f2017-01-12 19:50:33 -050078 typedef Eigen::Matrix<float, 4, Eigen::Dynamic> FourRowMatrixC;
79 typedef Eigen::Matrix<float, Eigen::Dynamic, 4> FourColMatrixC;
80 typedef Eigen::Matrix<float, 4, Eigen::Dynamic> FourRowMatrixR;
81 typedef Eigen::Matrix<float, Eigen::Dynamic, 4> FourColMatrixR;
Wenzel Jakob9e0a0562016-05-05 20:33:54 +020082 typedef Eigen::SparseMatrix<float, Eigen::RowMajor> SparseMatrixR;
83 typedef Eigen::SparseMatrix<float> SparseMatrixC;
84
Jason Rhinelander3f1ff3f2016-12-12 17:42:52 -050085 m.attr("have_eigen") = true;
Jason Rhinelander52f4be82016-09-03 14:54:22 -040086
Jason Rhinelander17d02832017-01-16 20:35:14 -050087 m.def("double_col", [](const Eigen::VectorXf &x) -> Eigen::VectorXf { return 2.0f * x; });
88 m.def("double_row", [](const Eigen::RowVectorXf &x) -> Eigen::RowVectorXf { return 2.0f * x; });
Dean Moldovan51439892017-02-28 18:07:51 +010089 m.def("double_complex", [](const Eigen::VectorXcf &x) -> Eigen::VectorXcf { return 2.0f * x; });
Jason Rhinelander17d02832017-01-16 20:35:14 -050090 m.def("double_threec", [](py::EigenDRef<Eigen::Vector3f> x) { x *= 2; });
91 m.def("double_threer", [](py::EigenDRef<Eigen::RowVector3f> x) { x *= 2; });
92 m.def("double_mat_cm", [](Eigen::MatrixXf x) -> Eigen::MatrixXf { return 2.0f * x; });
93 m.def("double_mat_rm", [](DenseMatrixR x) -> DenseMatrixR { return 2.0f * x; });
Wenzel Jakob9e0a0562016-05-05 20:33:54 +020094
Jason Rhinelander17d02832017-01-16 20:35:14 -050095 // Different ways of passing via Eigen::Ref; the first and second are the Eigen-recommended
96 m.def("cholesky1", [](Eigen::Ref<MatrixXdR> x) -> Eigen::MatrixXd { return x.llt().matrixL(); });
97 m.def("cholesky2", [](const Eigen::Ref<const MatrixXdR> &x) -> Eigen::MatrixXd { return x.llt().matrixL(); });
98 m.def("cholesky3", [](const Eigen::Ref<MatrixXdR> &x) -> Eigen::MatrixXd { return x.llt().matrixL(); });
99 m.def("cholesky4", [](Eigen::Ref<const MatrixXdR> x) -> Eigen::MatrixXd { return x.llt().matrixL(); });
100
101 // Mutators: these add some value to the given element using Eigen, but Eigen should be mapping into
102 // the numpy array data and so the result should show up there. There are three versions: one that
103 // works on a contiguous-row matrix (numpy's default), one for a contiguous-column matrix, and one
104 // for any matrix.
105 auto add_rm = [](Eigen::Ref<MatrixXdR> x, int r, int c, double v) { x(r,c) += v; };
106 auto add_cm = [](Eigen::Ref<Eigen::MatrixXd> x, int r, int c, double v) { x(r,c) += v; };
107
108 // Mutators (Eigen maps into numpy variables):
109 m.def("add_rm", add_rm); // Only takes row-contiguous
110 m.def("add_cm", add_cm); // Only takes column-contiguous
111 // Overloaded versions that will accept either row or column contiguous:
112 m.def("add1", add_rm);
113 m.def("add1", add_cm);
114 m.def("add2", add_cm);
115 m.def("add2", add_rm);
116 // This one accepts a matrix of any stride:
117 m.def("add_any", [](py::EigenDRef<Eigen::MatrixXd> x, int r, int c, double v) { x(r,c) += v; });
118
119 // Return mutable references (numpy maps into eigen varibles)
120 m.def("get_cm_ref", []() { return Eigen::Ref<Eigen::MatrixXd>(get_cm()); });
121 m.def("get_rm_ref", []() { return Eigen::Ref<MatrixXdR>(get_rm()); });
122 // The same references, but non-mutable (numpy maps into eigen variables, but is !writeable)
123 m.def("get_cm_const_ref", []() { return Eigen::Ref<const Eigen::MatrixXd>(get_cm()); });
124 m.def("get_rm_const_ref", []() { return Eigen::Ref<const MatrixXdR>(get_rm()); });
125 // Just the corners (via a Map instead of a Ref):
126 m.def("get_cm_corners", []() {
127 auto &x = get_cm();
128 return py::EigenDMap<Eigen::Matrix2d>(
129 x.data(),
130 py::EigenDStride(x.outerStride() * (x.rows() - 1), x.innerStride() * (x.cols() - 1)));
131 });
132 m.def("get_cm_corners_const", []() {
133 const auto &x = get_cm();
134 return py::EigenDMap<const Eigen::Matrix2d>(
135 x.data(),
136 py::EigenDStride(x.outerStride() * (x.rows() - 1), x.innerStride() * (x.cols() - 1)));
137 });
138
139 m.def("reset_refs", reset_refs); // Restores get_{cm,rm}_ref to original values
140
141 // Increments and returns ref to (same) matrix
142 m.def("incr_matrix", [](Eigen::Ref<Eigen::MatrixXd> m, double v) {
143 m += Eigen::MatrixXd::Constant(m.rows(), m.cols(), v);
144 return m;
145 }, py::return_value_policy::reference);
146
147 // Same, but accepts a matrix of any strides
148 m.def("incr_matrix_any", [](py::EigenDRef<Eigen::MatrixXd> m, double v) {
149 m += Eigen::MatrixXd::Constant(m.rows(), m.cols(), v);
150 return m;
151 }, py::return_value_policy::reference);
152
153 // Returns an eigen slice of even rows
154 m.def("even_rows", [](py::EigenDRef<Eigen::MatrixXd> m) {
155 return py::EigenDMap<Eigen::MatrixXd>(
156 m.data(), (m.rows() + 1) / 2, m.cols(),
157 py::EigenDStride(m.outerStride(), 2 * m.innerStride()));
158 }, py::return_value_policy::reference);
159
160 // Returns an eigen slice of even columns
161 m.def("even_cols", [](py::EigenDRef<Eigen::MatrixXd> m) {
162 return py::EigenDMap<Eigen::MatrixXd>(
163 m.data(), m.rows(), (m.cols() + 1) / 2,
164 py::EigenDStride(2 * m.outerStride(), m.innerStride()));
165 }, py::return_value_policy::reference);
Ben Northb063e642016-07-05 20:01:11 +0100166
Jason Rhinelander8657f302016-08-04 13:21:39 -0400167 // Returns diagonals: a vector-like object with an inner stride != 1
168 m.def("diagonal", [](const Eigen::Ref<const Eigen::MatrixXd> &x) { return x.diagonal(); });
169 m.def("diagonal_1", [](const Eigen::Ref<const Eigen::MatrixXd> &x) { return x.diagonal<1>(); });
170 m.def("diagonal_n", [](const Eigen::Ref<const Eigen::MatrixXd> &x, int index) { return x.diagonal(index); });
171
172 // Return a block of a matrix (gives non-standard strides)
173 m.def("block", [](const Eigen::Ref<const Eigen::MatrixXd> &x, int start_row, int start_col, int block_rows, int block_cols) {
174 return x.block(start_row, start_col, block_rows, block_cols);
175 });
176
Jason Rhinelander17d02832017-01-16 20:35:14 -0500177 // return value referencing/copying tests:
178 class ReturnTester {
179 Eigen::MatrixXd mat = create();
180 public:
181 ReturnTester() { print_created(this); }
182 ~ReturnTester() { print_destroyed(this); }
183 static Eigen::MatrixXd create() { return Eigen::MatrixXd::Ones(10, 10); }
184 static const Eigen::MatrixXd createConst() { return Eigen::MatrixXd::Ones(10, 10); }
185 Eigen::MatrixXd &get() { return mat; }
186 Eigen::MatrixXd *getPtr() { return &mat; }
187 const Eigen::MatrixXd &view() { return mat; }
188 const Eigen::MatrixXd *viewPtr() { return &mat; }
189 Eigen::Ref<Eigen::MatrixXd> ref() { return mat; }
190 Eigen::Ref<const Eigen::MatrixXd> refConst() { return mat; }
191 Eigen::Block<Eigen::MatrixXd> block(int r, int c, int nrow, int ncol) { return mat.block(r, c, nrow, ncol); }
192 Eigen::Block<const Eigen::MatrixXd> blockConst(int r, int c, int nrow, int ncol) const { return mat.block(r, c, nrow, ncol); }
193 py::EigenDMap<Eigen::Matrix2d> corners() { return py::EigenDMap<Eigen::Matrix2d>(mat.data(),
194 py::EigenDStride(mat.outerStride() * (mat.outerSize()-1), mat.innerStride() * (mat.innerSize()-1))); }
195 py::EigenDMap<const Eigen::Matrix2d> cornersConst() const { return py::EigenDMap<const Eigen::Matrix2d>(mat.data(),
196 py::EigenDStride(mat.outerStride() * (mat.outerSize()-1), mat.innerStride() * (mat.innerSize()-1))); }
197 };
198 using rvp = py::return_value_policy;
199 py::class_<ReturnTester>(m, "ReturnTester")
200 .def(py::init<>())
201 .def_static("create", &ReturnTester::create)
202 .def_static("create_const", &ReturnTester::createConst)
203 .def("get", &ReturnTester::get, rvp::reference_internal)
204 .def("get_ptr", &ReturnTester::getPtr, rvp::reference_internal)
205 .def("view", &ReturnTester::view, rvp::reference_internal)
206 .def("view_ptr", &ReturnTester::view, rvp::reference_internal)
207 .def("copy_get", &ReturnTester::get) // Default rvp: copy
208 .def("copy_view", &ReturnTester::view) // "
209 .def("ref", &ReturnTester::ref) // Default for Ref is to reference
210 .def("ref_const", &ReturnTester::refConst) // Likewise, but const
211 .def("ref_safe", &ReturnTester::ref, rvp::reference_internal)
212 .def("ref_const_safe", &ReturnTester::refConst, rvp::reference_internal)
213 .def("copy_ref", &ReturnTester::ref, rvp::copy)
214 .def("copy_ref_const", &ReturnTester::refConst, rvp::copy)
215 .def("block", &ReturnTester::block)
216 .def("block_safe", &ReturnTester::block, rvp::reference_internal)
217 .def("block_const", &ReturnTester::blockConst, rvp::reference_internal)
218 .def("copy_block", &ReturnTester::block, rvp::copy)
219 .def("corners", &ReturnTester::corners, rvp::reference_internal)
220 .def("corners_const", &ReturnTester::cornersConst, rvp::reference_internal)
221 ;
222
Jason Rhinelander9ffb3dd2016-08-04 15:24:41 -0400223 // Returns a DiagonalMatrix with diagonal (1,2,3,...)
224 m.def("incr_diag", [](int k) {
225 Eigen::DiagonalMatrix<int, Eigen::Dynamic> m(k);
226 for (int i = 0; i < k; i++) m.diagonal()[i] = i+1;
227 return m;
228 });
229
230 // Returns a SelfAdjointView referencing the lower triangle of m
231 m.def("symmetric_lower", [](const Eigen::MatrixXi &m) {
232 return m.selfadjointView<Eigen::Lower>();
233 });
234 // Returns a SelfAdjointView referencing the lower triangle of m
235 m.def("symmetric_upper", [](const Eigen::MatrixXi &m) {
236 return m.selfadjointView<Eigen::Upper>();
237 });
238
Jason Rhinelander17d02832017-01-16 20:35:14 -0500239 // Test matrix for various functions below.
240 Eigen::MatrixXf mat(5, 6);
241 mat << 0, 3, 0, 0, 0, 11,
242 22, 0, 0, 0, 17, 11,
243 7, 5, 0, 1, 0, 11,
244 0, 0, 0, 0, 0, 11,
245 0, 0, 14, 0, 8, 11;
Wenzel Jakob9e0a0562016-05-05 20:33:54 +0200246
Jason Rhinelander17d02832017-01-16 20:35:14 -0500247 m.def("fixed_r", [mat]() -> FixedMatrixR { return FixedMatrixR(mat); });
248 m.def("fixed_r_const", [mat]() -> const FixedMatrixR { return FixedMatrixR(mat); });
249 m.def("fixed_c", [mat]() -> FixedMatrixC { return FixedMatrixC(mat); });
250 m.def("fixed_copy_r", [](const FixedMatrixR &m) -> FixedMatrixR { return m; });
251 m.def("fixed_copy_c", [](const FixedMatrixC &m) -> FixedMatrixC { return m; });
252 m.def("fixed_mutator_r", [](Eigen::Ref<FixedMatrixR>) {});
253 m.def("fixed_mutator_c", [](Eigen::Ref<FixedMatrixC>) {});
254 m.def("fixed_mutator_a", [](py::EigenDRef<FixedMatrixC>) {});
255 m.def("dense_r", [mat]() -> DenseMatrixR { return DenseMatrixR(mat); });
256 m.def("dense_c", [mat]() -> DenseMatrixC { return DenseMatrixC(mat); });
257 m.def("dense_copy_r", [](const DenseMatrixR &m) -> DenseMatrixR { return m; });
258 m.def("dense_copy_c", [](const DenseMatrixC &m) -> DenseMatrixC { return m; });
259 m.def("sparse_r", [mat]() -> SparseMatrixR { return Eigen::SparseView<Eigen::MatrixXf>(mat); });
260 m.def("sparse_c", [mat]() -> SparseMatrixC { return Eigen::SparseView<Eigen::MatrixXf>(mat); });
261 m.def("sparse_copy_r", [](const SparseMatrixR &m) -> SparseMatrixR { return m; });
262 m.def("sparse_copy_c", [](const SparseMatrixC &m) -> SparseMatrixC { return m; });
263 m.def("partial_copy_four_rm_r", [](const FourRowMatrixR &m) -> FourRowMatrixR { return m; });
264 m.def("partial_copy_four_rm_c", [](const FourColMatrixR &m) -> FourColMatrixR { return m; });
265 m.def("partial_copy_four_cm_r", [](const FourRowMatrixC &m) -> FourRowMatrixC { return m; });
266 m.def("partial_copy_four_cm_c", [](const FourColMatrixC &m) -> FourColMatrixC { return m; });
Wenzel Jakob9e0a0562016-05-05 20:33:54 +0200267
Jason Rhinelander17d02832017-01-16 20:35:14 -0500268 // Test that we can cast a numpy object to a Eigen::MatrixXd explicitly
269 m.def("cpp_copy", [](py::handle m) { return m.cast<Eigen::MatrixXd>()(1, 0); });
270 m.def("cpp_ref_c", [](py::handle m) { return m.cast<Eigen::Ref<Eigen::MatrixXd>>()(1, 0); });
271 m.def("cpp_ref_r", [](py::handle m) { return m.cast<Eigen::Ref<MatrixXdR>>()(1, 0); });
272 m.def("cpp_ref_any", [](py::handle m) { return m.cast<py::EigenDRef<Eigen::MatrixXd>>()(1, 0); });
Wenzel Jakob9e0a0562016-05-05 20:33:54 +0200273
Wenzel Jakob9e0a0562016-05-05 20:33:54 +0200274
Jason Rhinelander17d02832017-01-16 20:35:14 -0500275 // Test that we can prevent copying into an argument that would normally copy: First a version
276 // that would allow copying (if types or strides don't match) for comparison:
277 m.def("get_elem", &get_elem);
278 // Now this alternative that calls the tells pybind to fail rather than copy:
279 m.def("get_elem_nocopy", [](Eigen::Ref<const Eigen::MatrixXd> m) -> double { return get_elem(m); },
280 py::arg().noconvert());
281 // Also test a row-major-only no-copy const ref:
282 m.def("get_elem_rm_nocopy", [](Eigen::Ref<const Eigen::Matrix<long, -1, -1, Eigen::RowMajor>> &m) -> long { return m(2, 1); },
283 py::arg().noconvert());
Jason Rhinelanderefa87262017-03-17 14:51:52 -0300284
285 // Issue #738: 1xN or Nx1 2D matrices were neither accepted nor properly copied with an
286 // incompatible stride value on the length-1 dimension--but that should be allowed (without
287 // requiring a copy!) because the stride value can be safely ignored on a size-1 dimension.
288 m.def("iss738_f1", &adjust_matrix<const Eigen::Ref<const Eigen::MatrixXd> &>, py::arg().noconvert());
289 m.def("iss738_f2", &adjust_matrix<const Eigen::Ref<const Eigen::Matrix<double, -1, -1, Eigen::RowMajor>> &>, py::arg().noconvert());
Dean Moldovan0d765f42017-03-21 01:15:20 +0100290
Jason Rhinelandere9e17742017-04-08 19:26:42 -0400291 // Make sure named arguments are working properly:
292 m.def("matrix_multiply", [](const py::EigenDRef<const Eigen::MatrixXd> A, const py::EigenDRef<const Eigen::MatrixXd> B)
293 -> Eigen::MatrixXd {
294 if (A.cols() != B.rows()) throw std::domain_error("Nonconformable matrices!");
295 return A * B;
296 }, py::arg("A"), py::arg("B"));
297
Dean Moldovan0d765f42017-03-21 01:15:20 +0100298 py::class_<CustomOperatorNew>(m, "CustomOperatorNew")
299 .def(py::init<>())
300 .def_readonly("a", &CustomOperatorNew::a)
301 .def_readonly("b", &CustomOperatorNew::b);
Dean Moldovan30f6c3b2017-06-26 23:20:39 +0200302
303 // test_eigen_ref_life_support
304 // In case of a failure (the caster's temp array does not live long enough), creating
305 // a new array (np.ones(10)) increases the chances that the temp array will be garbage
306 // collected and/or that its memory will be overridden with different values.
307 m.def("get_elem_direct", [](Eigen::Ref<const Eigen::VectorXd> v) {
308 py::module::import("numpy").attr("ones")(10);
309 return v(5);
310 });
311 m.def("get_elem_indirect", [](std::vector<Eigen::Ref<const Eigen::VectorXd>> v) {
312 py::module::import("numpy").attr("ones")(10);
313 return v[0](5);
314 });
Jason Rhinelander52f4be82016-09-03 14:54:22 -0400315});