| /external/ceres-solver/examples/ |
| H A D | ellipse_approximation.cc | 407 (X.rowwise() - kY.row(i)).rowwise().squaredNorm().minCoeff(&t[i]);
|
| /external/clang/test/SemaTemplate/ |
| H A D | instantiate-member-template.cpp | 175 const typename Inner<X0>::Type minCoeff() const;
188 const typename Inner<X0>::Type minCoeff() const;
|
| /external/eigen/Eigen/src/Core/ |
| H A D | DenseBase.h | 402 typename internal::traits<Derived>::Scalar minCoeff() const;
406 typename internal::traits<Derived>::Scalar minCoeff(IndexType* row, IndexType* col) const;
410 typename internal::traits<Derived>::Scalar minCoeff(IndexType* index) const;
|
| H A D | Redux.h | 321 * \sa DenseBase::sum(), DenseBase::minCoeff(), DenseBase::maxCoeff(), MatrixBase::colwise(), MatrixBase::rowwise()
338 DenseBase<Derived>::minCoeff() const function in class:Eigen::DenseBase
|
| H A D | VectorwiseOp.h | 126 EIGEN_MEMBER_FUNCTOR(minCoeff, (Size-1)*NumTraits<Scalar>::AddCost);
287 * \sa DenseBase::minCoeff() */
288 const typename ReturnType<internal::member_minCoeff>::Type minCoeff() const function in class:Eigen::VectorwiseOp
|
| H A D | Visitor.h | 73 * \sa minCoeff(Index*,Index*), maxCoeff(Index*,Index*), DenseBase::redux()
112 * \sa DenseBase::minCoeff(Index*, Index*)
170 * \sa DenseBase::minCoeff(Index*), DenseBase::maxCoeff(Index*,Index*), DenseBase::visitor(), DenseBase::minCoeff()
175 DenseBase<Derived>::minCoeff(IndexType* rowId, IndexType* colId) const function in class:Eigen::DenseBase
187 * \sa DenseBase::minCoeff(IndexType*,IndexType*), DenseBase::maxCoeff(IndexType*,IndexType*), DenseBase::visitor(), DenseBase::minCoeff()
192 DenseBase<Derived>::minCoeff(IndexType* index) const function in class:Eigen::DenseBase
204 * \sa DenseBase::minCoeff(IndexType*,IndexType*), DenseBase::visitor(), DenseBase::maxCoeff()
221 * \sa DenseBase::maxCoeff(IndexType*,IndexType*), DenseBase::minCoeff(IndexTyp
[all...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| H A D | ComplexEigenSolver.h | 320 m_eivalues.cwiseAbs().tail(n-i).minCoeff(&k);
|
| H A D | SelfAdjointEigenSolver.h | 461 m_eivalues.segment(i,n-i).minCoeff(&k);
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 332 Index minrow = ju.segment(jj,sizel-jj).minCoeff(&k); // k is relative to the segment
|
| /external/eigen/blas/ |
| H A D | level1_impl.h | 71 if(*incx==1) vector(x,*n).cwiseAbs().minCoeff(&ret);
72 else vector(x,*n,std::abs(*incx)).cwiseAbs().minCoeff(&ret);
|
| /external/eigen/doc/examples/ |
| H A D | Tutorial_ReductionsVisitorsBroadcasting_broadcast_1nn.cpp | 20 (m.colwise() - v).colwise().squaredNorm().minCoeff(&index);
|
| H A D | Tutorial_ReductionsVisitorsBroadcasting_visitors.cpp | 20 float min = m.minCoeff(&minRow, &minCol);
|
| H A D | tut_arithmetic_redux_basic.cpp | 13 cout << "Here is mat.minCoeff(): " << mat.minCoeff() << endl;
|
| /external/eigen/doc/snippets/ |
| H A D | PartialRedux_minCoeff.cpp | 3 cout << "Here is the minimum of each column:" << endl << m.colwise().minCoeff() << endl;
|
| H A D | tut_arithmetic_redux_minmax.cpp | 3 float minOfM = m.minCoeff(&i,&j);
|
| /external/eigen/test/ |
| H A D | array.cpp | 122 Scalar mid = (m1.cwiseAbs().minCoeff() + m1.cwiseAbs().maxCoeff())/Scalar(2);
248 Scalar minM1 = m1.minCoeff();
|
| H A D | array_for_matrix.cpp | 109 Scalar mid = (m1.cwiseAbs().minCoeff() + m1.cwiseAbs().maxCoeff())/Scalar(2);
156 Scalar minM1 = m1.minCoeff();
|
| H A D | geo_alignedbox.cpp | 115 VERIFY_IS_APPROX(sides[0], box.sizes().minCoeff() );
142 VERIFY_IS_APPROX(sides[0], box.sizes().minCoeff() );
|
| H A D | redux.cpp | 43 VERIFY_IS_APPROX(m1.real().minCoeff(), numext::real(minc));
54 VERIFY_IS_APPROX(m1.block(r0,c0,r1,c1).real().minCoeff(), m1.block(r0,c0,r1,c1).real().eval().minCoeff());
86 VERIFY_IS_APPROX(minc, v.real().head(i).minCoeff());
103 VERIFY_IS_APPROX(minc, v.real().tail(size-i).minCoeff());
120 VERIFY_IS_APPROX(minc, v.real().segment(i, size-2*i).minCoeff());
128 VERIFY_RAISES_ASSERT(v.head(0).minCoeff());
|
| H A D | visitor.cpp | 48 eigen_minc = m.minCoeff(&eigen_minrow,&eigen_mincol);
56 VERIFY_IS_APPROX(minc, m.minCoeff());
92 eigen_minc = v.minCoeff(&eigen_minidx);
98 VERIFY_IS_APPROX(minc, v.minCoeff());
107 v1.minCoeff(&eigen_minidx);
|
| /external/eigen/test/eigen2/ |
| H A D | eigen2_array.cpp | 87 Scalar mid = (m1.cwise().abs().minCoeff() + m1.cwise().abs().maxCoeff())/Scalar(2);
|
| H A D | eigen2_visitor.cpp | 47 eigen_minc = m.minCoeff(&eigen_minrow,&eigen_mincol);
55 VERIFY_IS_APPROX(minc, m.minCoeff());
90 eigen_minc = v.minCoeff(&eigen_minidx);
96 VERIFY_IS_APPROX(minc, v.minCoeff());
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| H A D | IncompleteCholesky.h | 247 rowIdx.segment(jk,p).minCoeff(&minpos);
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| H A D | MatrixPower.h | 386 m_conditionNumber = absTdiag.maxCoeff() / absTdiag.minCoeff();
|
| /external/eigen/unsupported/test/ |
| H A D | polynomialsolver.cpp | 134 VERIFY( internal::isApprox( roots.array().abs().minCoeff(),
148 VERIFY( internal::isApprox( real_roots.array().abs().minCoeff(), abs( r ), psPrec ) ); }
160 VERIFY( internal::isApprox( real_roots.array().minCoeff(), r, psPrec ) ); }
|