devtools/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2026-04-10 11:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

Added support for component-wise pow (equivalent to Matlab's operator .^).

Browse Source
This commit is contained in:
Hauke Heibel
2012-03-07 08:58:42 +01:00
parent aee0db2e2c
commit 81c1336ab8
3 changed files with 56 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
test/array.cpp
View File

@@ -45,9 +45,6 @@ template<typename ArrayType> void array(const ArrayType& m)
Scalar s1 = internal::random<Scalar>(),
s2 = internal::random<Scalar>();
// scalar by array division
VERIFY_IS_APPROX(s1/m1, s1 * m1.inverse());
// scalar addition
VERIFY_IS_APPROX(m1 + s1, s1 + m1);
VERIFY_IS_APPROX(m1 + s1, ArrayType::Constant(rows,cols,s1) + m1);
@@ -212,9 +209,18 @@ template<typename ArrayType> void array_real(const ArrayType& m)
VERIFY_IS_APPROX(m1.pow(2), m1.square());
VERIFY_IS_APPROX(std::pow(m1,2), m1.square());
ArrayType exponents = ArrayType::Constant(rows, cols, RealScalar(2));
VERIFY_IS_APPROX(std::pow(m1,exponents), m1.square());
m3 = m1.abs();
VERIFY_IS_APPROX(m3.pow(RealScalar(0.5)), m3.sqrt());
VERIFY_IS_APPROX(std::pow(m3,RealScalar(0.5)), m3.sqrt());
// scalar by array division
const auto t1 = (s1/m1).eval();
const auto t2 = (s1 * m1.inverse()).eval();
VERIFY_IS_APPROX(s1/m1, s1 * m1.inverse());
}
template<typename ArrayType> void array_complex(const ArrayType& m)