| /external/eigen/doc/snippets/ |
| PartialRedux_minCoeff.cpp | 3 cout << "Here is the minimum of each column:" << endl << m.colwise().minCoeff() << endl;
|
| tut_arithmetic_redux_minmax.cpp | 3 float minOfM = m.minCoeff(&i,&j);
|
| /external/eigen/doc/examples/ |
| Tutorial_ReductionsVisitorsBroadcasting_broadcast_1nn.cpp | 20 (m.colwise() - v).colwise().squaredNorm().minCoeff(&index);
|
| Tutorial_ReductionsVisitorsBroadcasting_visitors.cpp | 20 float min = m.minCoeff(&minRow, &minCol);
|
| tut_arithmetic_redux_basic.cpp | 13 cout << "Here is mat.minCoeff(): " << mat.minCoeff() << endl;
|
| /external/eigen/test/ |
| visitor.cpp | 48 eigen_minc = m.minCoeff(&eigen_minrow,&eigen_mincol);
56 VERIFY_IS_APPROX(minc, m.minCoeff());
97 eigen_minc = v.minCoeff(&eigen_minidx);
103 VERIFY_IS_APPROX(minc, v.minCoeff());
112 v1.minCoeff(&eigen_minidx);
|
| redux.cpp | 46 VERIFY_IS_APPROX(m1.real().minCoeff(), numext::real(minc));
57 VERIFY_IS_APPROX(m1.block(r0,c0,r1,c1).real().minCoeff(), m1.block(r0,c0,r1,c1).real().eval().minCoeff());
103 VERIFY_IS_APPROX(minc, v.real().head(i).minCoeff());
120 VERIFY_IS_APPROX(minc, v.real().tail(size-i).minCoeff());
137 VERIFY_IS_APPROX(minc, v.real().segment(i, size-2*i).minCoeff());
145 VERIFY_RAISES_ASSERT(v.head(0).minCoeff());
|
| geo_alignedbox.cpp | 124 VERIFY_IS_APPROX(sides[0], box.sizes().minCoeff() );
151 VERIFY_IS_APPROX(sides[0], box.sizes().minCoeff() );
|
| geo_homogeneous.cpp | 43 VERIFY_IS_APPROX(v0.homogeneous().minCoeff(), hv0.minCoeff());
|
| mixingtypes.cpp | 241 if(mcd.array().abs().minCoeff()>epsd)
245 if(md.array().abs().minCoeff()>epsd)
250 if(md.array().abs().minCoeff()>epsd || mcd.array().abs().minCoeff()>epsd)
268 if(md.array().abs().minCoeff()>epsd)
|
| eigensolver_complex.cpp | 30 if(diffs.col(col).segment(col,n-i).minCoeff(&best_index) > tol)
|
| array_for_matrix.cpp | 120 Scalar mid = (m1.cwiseAbs().minCoeff() + m1.cwiseAbs().maxCoeff())/Scalar(2);
185 Scalar minM1 = m1.minCoeff();
|
| geo_hyperplane.cpp | 61 while(scaling.diagonal().cwiseAbs().minCoeff()<RealScalar(1e-4)) scaling.diagonal() = VectorType::Random();
|
| array.cpp | 177 Scalar mid = (m1.cwiseAbs().minCoeff() + m1.cwiseAbs().maxCoeff())/Scalar(2);
437 Scalar minM1 = m1.minCoeff();
|
| /external/eigen/unsupported/test/ |
| polynomialsolver.cpp | 136 VERIFY( internal::isApprox( roots.array().abs().minCoeff(),
150 VERIFY( internal::isApprox( real_roots.array().abs().minCoeff(), abs( r ), psPrec ) ); }
162 VERIFY( internal::isApprox( real_roots.array().minCoeff(), r, psPrec ) ); }
|
| polynomialutils.cpp | 79 _Scalar min = roots.array().abs().minCoeff();
|
| autodiff.cpp | 341 const AD minVal = v.minCoeff();
|
| /external/clang/test/SemaTemplate/ |
| 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/ |
| Visitor.h | 102 * \sa minCoeff(Index*,Index*), maxCoeff(Index*,Index*), DenseBase::redux()
142 * \sa DenseBase::minCoeff(Index*, Index*)
197 /** \fn DenseBase<Derived>::minCoeff(IndexType* rowId, IndexType* colId) const
201 * \sa DenseBase::minCoeff(Index*), DenseBase::maxCoeff(Index*,Index*), DenseBase::visit(), DenseBase::minCoeff()
207 DenseBase<Derived>::minCoeff(IndexType* rowId, IndexType* colId) const
219 * \sa DenseBase::minCoeff(IndexType*,IndexType*), DenseBase::maxCoeff(IndexType*,IndexType*), DenseBase::visit(), DenseBase::minCoeff()
225 DenseBase<Derived>::minCoeff(IndexType* index) const
238 * \sa DenseBase::minCoeff(IndexType*,IndexType*), DenseBase::visit(), DenseBase::maxCoeff(
[all...] |
| DenseBase.h | 446 EIGEN_DEVICE_FUNC typename internal::traits<Derived>::Scalar minCoeff() const;
450 typename internal::traits<Derived>::Scalar minCoeff(IndexType* row, IndexType* col) const;
454 typename internal::traits<Derived>::Scalar minCoeff(IndexType* index) const;
|
| VectorwiseOp.h | 106 EIGEN_MEMBER_FUNCTOR(minCoeff, (Size-1)*NumTraits<Scalar>::AddCost);
302 * \sa DenseBase::minCoeff() */
304 const MinCoeffReturnType minCoeff() const
|
| /external/eigen/blas/ |
| level1_impl.h | 71 if(*incx==1) make_vector(x,*n).cwiseAbs().minCoeff(&ret);
72 else make_vector(x,*n,std::abs(*incx)).cwiseAbs().minCoeff(&ret);
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| ComplexEigenSolver.h | 333 m_eivalues.cwiseAbs().tail(n-i).minCoeff(&k);
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteCholesky.h | 385 rowIdx.segment(jk,p).minCoeff(&minpos);
|
| IncompleteLUT.h | 344 Index minrow = ju.segment(jj,sizel-jj).minCoeff(&k); // k is relative to the segment
|
