| /external/eigen/test/ |
| cwiseop.cpp | 86 VERIFY_IS_APPROX(m1.cwise().pow(2), m1.cwise().abs2());
87 VERIFY_IS_APPROX(m1.cwise().pow(2), m1.cwise().square());
88 VERIFY_IS_APPROX(m1.cwise().pow(3), m1.cwise().cube());
90 VERIFY_IS_APPROX(m1 + mones, m1.cwise()+Scalar(1));
91 VERIFY_IS_APPROX(m1 - mones, m1.cwise()-Scalar(1));
92 m3 = m1; m3.cwise() += 1;
94 m3 = m1; m3.cwise() -= 1
[all...] |
| eigen2support.cpp | 29 VERIFY_IS_APPROX(m1.cwise() + s1, s1 + m1.cwise());
30 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1);
31 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) );
33 m3.cwise() += s2;
34 VERIFY_IS_APPROX(m3, m1.cwise() + s2);
36 m3.cwise() -= s1;
37 VERIFY_IS_APPROX(m3, m1.cwise() - s1);
|
| /external/eigen/test/eigen2/ |
| eigen2_cwiseop.cpp | 79 VERIFY_IS_APPROX(m1.cwise().pow(2), m1.cwise().abs2());
80 VERIFY_IS_APPROX(m1.cwise().pow(2), m1.cwise().square());
81 VERIFY_IS_APPROX(m1.cwise().pow(3), m1.cwise().cube());
83 VERIFY_IS_APPROX(m1 + mones, m1.cwise()+Scalar(1));
84 VERIFY_IS_APPROX(m1 - mones, m1.cwise()-Scalar(1));
85 m3 = m1; m3.cwise() += 1;
87 m3 = m1; m3.cwise() -= 1
[all...] |
| eigen2_array.cpp | 34 VERIFY_IS_APPROX(m1.cwise() + s1, s1 + m1.cwise());
35 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1);
36 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) );
38 m3.cwise() += s2;
39 VERIFY_IS_APPROX(m3, m1.cwise() + s2);
41 m3.cwise() -= s1;
42 VERIFY_IS_APPROX(m3, m1.cwise() - s1);
68 VERIFY(((m1.cwise() + Scalar(1)).cwise() > m1).all())
[all...] |
| eigen2_nomalloc.cpp | 52 VERIFY_IS_APPROX(m1.cwise() * m1.block(0,0,rows,cols), m1.cwise() * m1);
|
| eigen2_triangular.cpp | 78 VERIFY(m3.template marked<Eigen::LowerTriangular>().solveTriangular(m3).cwise().abs().isIdentity(test_precision<RealScalar>()));
80 .solveTriangular(m3.transpose()).cwise().abs().isIdentity(test_precision<RealScalar>()));
84 VERIFY(m4.cwise().abs().isIdentity(test_precision<RealScalar>()));
87 VERIFY(m3.template marked<Eigen::UpperTriangular>().solveTriangular(m3).cwise().abs().isIdentity(test_precision<RealScalar>()));
89 .solveTriangular(m3.transpose()).cwise().abs().isIdentity(test_precision<RealScalar>()));
93 VERIFY(m4.cwise().abs().isIdentity(test_precision<RealScalar>()));
|
| eigen2_linearstructure.cpp | 67 VERIFY_IS_APPROX(m1.cwise() * m1.block(0,0,rows,cols), m1.cwise() * m1);
|
| eigen2_sparse_basic.cpp | 217 VERIFY_IS_APPROX(m3.cwise()*(m1+m2), refM3.cwise()*(refM1+refM2));
229 // sparse cwise* dense
230 VERIFY_IS_APPROX(m3.cwise()*refM4, refM3.cwise()*refM4);
231 // VERIFY_IS_APPROX(m3.cwise()/refM4, refM3.cwise()/refM4);
|
| product.h | 17 return !((m1-m2).cwise().abs2().maxCoeff() < epsilon * epsilon
18 * std::max(m1.cwise().abs2().maxCoeff(), m2.cwise().abs2().maxCoeff()));
|
| eigen2_eigensolver.cpp | 67 VERIFY_IS_APPROX(_evec.cwise().abs(), eiSymm.eigenvectors().cwise().abs());
|
| eigen2_regression.cpp | 39 Scalar x = - (hyperplane->coeffs().start(size).cwise()*cur_point).sum();
|
| eigen2_geometry.cpp | 164 t1.prescale(v1.cwise().inverse());
218 t4.scale(v3.cwise().inverse());
248 * (t21.prescale(v21.cwise().inverse()).translate(-v20))).matrix().isIdentity(test_precision<Scalar>()) );
|
| eigen2_geometry_with_eigen2_prefix.cpp | 166 t1.prescale(v1.cwise().inverse());
220 t4.scale(v3.cwise().inverse());
250 * (t21.prescale(v21.cwise().inverse()).translate(-v20))).matrix().isIdentity(test_precision<Scalar>()) );
|
| /external/eigen/bench/ |
| vdw_new.cpp | 24 return (interactions2.cwise()/interactions1)
25 .cwise().cube()
26 .cwise().square()
27 .cwise().square()
|
| benchmarkXcwise.cpp | 31 m = VECTYPE::Ones(VECSIZE) + 0.00005 * (m.cwise().square() + m/4);
|
| quat_slerp.cpp | 206 maxerr = maxerr.cwise().max(err);
|
| bench_norm.cpp | 53 Scalar s = v.cwise().abs().maxCoeff();
|
| /external/eigen/doc/examples/ |
| MatrixBase_cwise_const.cpp | 15 cout << m.cwise() * n << endl;
17 cout << m.cwise().pow(3) << endl;
|
| /external/eigen/Eigen/src/Eigen2Support/Geometry/ |
| AlignedBox.h | 56 inline bool isNull() const { return (m_min.cwise() > m_max).any(); }
76 { return (m_min.cwise()<=p).all() && (p.cwise()<=m_max).all(); }
80 { return (m_min.cwise()<=(b.min)()).all() && ((b.max)().cwise()<=m_max).all(); }
84 { m_min = (m_min.cwise().min)(p); m_max = (m_max.cwise().max)(p); return *this; }
88 { m_min = (m_min.cwise().min)(b.m_min); m_max = (m_max.cwise().max)(b.m_max); return *this; }
92 { m_min = (m_min.cwise().max)(b.m_min); m_max = (m_max.cwise().min)(b.m_max); return *this;
[all...] |
| Scaling.h | 79 { return Scaling(coeffs().cwise() * other.coeffs()); }
107 { return Scaling(coeffs().cwise().inverse()); }
153 res.translation() = m_coeffs.cwise() * t.vector();
|
| AngleAxis.h | 209 res.diagonal() = (cos1_axis.cwise() * m_axis).cwise() + c;
|
| /external/eigen/doc/ |
| tutorial.cpp | 38 m4 = m4.cwise()*m4;
39 m3 = m3.cwise().cos();
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| Cwise.h | 17 * convenient macro to defined the return type of a cwise binary operation */
22 * convenient macro to defined the return type of a cwise unary operation */
27 * convenient macro to defined the return type of a cwise comparison to a scalar */
32 /** \class Cwise
39 * It is the return type of MatrixBase::cwise()
48 * \sa MatrixBase::cwise() const, MatrixBase::cwise()
50 template<typename ExpressionType> class Cwise
59 inline Cwise(const ExpressionType& matrix) : m_matrix(matrix) {}
99 /** \relates Cwise */
172 inline const Cwise<Derived> MatrixBase<Derived>::cwise() const function in class:Eigen::MatrixBase
185 inline Cwise<Derived> MatrixBase<Derived>::cwise() function in class:Eigen::MatrixBase
[all...] |
| LeastSquares.h | 165 result->offset() = - (result->normal().cwise()* mean).sum();
|
| /external/eigen/Eigen/src/Core/ |
| MatrixBase.h | 477 inline const Cwise<Derived> cwise() const;
478 inline Cwise<Derived> cwise();
|
