/external/eigen/doc/examples/ |
Tutorial_ReductionsVisitorsBroadcasting_reductions_operatornorm.cpp | 13 cout << "1-norm(m) = " << m.cwiseAbs().colwise().sum().maxCoeff() 14 << " == " << m.colwise().lpNorm<1>().maxCoeff() << endl; 16 cout << "infty-norm(m) = " << m.cwiseAbs().rowwise().sum().maxCoeff() 17 << " == " << m.rowwise().lpNorm<1>().maxCoeff() << endl;
|
Tutorial_ReductionsVisitorsBroadcasting_colwise.cpp | 12 << mat.colwise().maxCoeff() << std::endl;
|
Tutorial_ReductionsVisitorsBroadcasting_rowwise.cpp | 12 << mat.rowwise().maxCoeff() << std::endl;
|
Tutorial_ReductionsVisitorsBroadcasting_maxnorm.cpp | 13 float maxNorm = mat.colwise().sum().maxCoeff(&maxIndex);
|
Tutorial_ReductionsVisitorsBroadcasting_visitors.cpp | 16 float max = m.maxCoeff(&maxRow, &maxCol);
|
tut_arithmetic_redux_basic.cpp | 14 cout << "Here is mat.maxCoeff(): " << mat.maxCoeff() << endl;
|
/external/eigen/doc/snippets/ |
PartialRedux_maxCoeff.cpp | 3 cout << "Here is the maximum of each column:" << endl << m.colwise().maxCoeff() << endl;
|
MatrixBase_colwise.cpp | 5 << endl << m.cwiseAbs().colwise().maxCoeff() << endl;
|
MatrixBase_rowwise.cpp | 5 << endl << m.cwiseAbs().rowwise().maxCoeff() << endl;
|
tut_arithmetic_redux_minmax.cpp | 9 int maxOfV = v.maxCoeff(&i);
|
/external/eigen/Eigen/src/Core/ |
StableNorm.h | 20 Scalar maxCoeff = bl.cwiseAbs().maxCoeff(); 22 if(maxCoeff>scale) 24 ssq = ssq * numext::abs2(scale/maxCoeff); 25 Scalar tmp = Scalar(1)/maxCoeff; 31 else if(maxCoeff>NumTraits<Scalar>::highest()) // we got a INF 34 scale = maxCoeff; 38 scale = maxCoeff; 42 else if(maxCoeff!=maxCoeff) // we got a Na [all...] |
Dot.h | 168 RealScalar w = n.cwiseAbs().maxCoeff(); 190 RealScalar w = cwiseAbs().maxCoeff(); 241 return m.cwiseAbs().maxCoeff();
|
Visitor.h | 102 * \sa minCoeff(Index*,Index*), maxCoeff(Index*,Index*), DenseBase::redux() 170 * \sa DenseBase::maxCoeff(Index*, Index*) 201 * \sa DenseBase::minCoeff(Index*), DenseBase::maxCoeff(Index*,Index*), DenseBase::visit(), DenseBase::minCoeff() 219 * \sa DenseBase::minCoeff(IndexType*,IndexType*), DenseBase::maxCoeff(IndexType*,IndexType*), DenseBase::visit(), DenseBase::minCoeff() 234 /** \fn DenseBase<Derived>::maxCoeff(IndexType* rowId, IndexType* colId) const 238 * \sa DenseBase::minCoeff(IndexType*,IndexType*), DenseBase::visit(), DenseBase::maxCoeff() 244 DenseBase<Derived>::maxCoeff(IndexType* rowPtr, IndexType* colPtr) const 256 * \sa DenseBase::maxCoeff(IndexType*,IndexType*), DenseBase::minCoeff(IndexType*,IndexType*), DenseBase::visitor(), DenseBase::maxCoeff() 262 DenseBase<Derived>::maxCoeff(IndexType* index) cons [all...] |
/external/eigen/test/ |
visitor.cpp | 49 eigen_maxc = m.maxCoeff(&eigen_maxrow,&eigen_maxcol); 57 VERIFY_IS_APPROX(maxc, m.maxCoeff()); 59 eigen_maxc = (m.adjoint()*m).maxCoeff(&eigen_maxrow,&eigen_maxcol); 60 eigen_maxc = (m.adjoint()*m).eval().maxCoeff(&maxrow,&maxcol); 98 eigen_maxc = v.maxCoeff(&eigen_maxidx); 104 VERIFY_IS_APPROX(maxc, v.maxCoeff()); 113 v2.maxCoeff(&eigen_maxidx);
|
redux.cpp | 47 VERIFY_IS_APPROX(m1.real().maxCoeff(), numext::real(maxc)); 58 VERIFY_IS_APPROX(m1.block(r0,c0,r1,c1).real().maxCoeff(), m1.block(r0,c0,r1,c1).real().eval().maxCoeff()); 104 VERIFY_IS_APPROX(maxc, v.real().head(i).maxCoeff()); 121 VERIFY_IS_APPROX(maxc, v.real().tail(size-i).maxCoeff()); 138 VERIFY_IS_APPROX(maxc, v.real().segment(i, size-2*i).maxCoeff()); 146 VERIFY_RAISES_ASSERT(v.head(0).maxCoeff());
|
geo_alignedbox.cpp | 123 VERIFY_IS_APPROX(sides[1], box.sizes().maxCoeff() ); 150 VERIFY_IS_APPROX(sides[1], box.sizes().maxCoeff() );
|
geo_homogeneous.cpp | 44 VERIFY_IS_APPROX(v0.homogeneous().maxCoeff(), hv0.maxCoeff());
|
eigensolver_selfadjoint.cpp | 27 RealScalar scaling = m.cwiseAbs().maxCoeff(); 31 VERIFY(eiSymm.eigenvalues().cwiseAbs().maxCoeff() <= (std::numeric_limits<RealScalar>::min)()); 55 VERIFY(eiDirect.eigenvalues().cwiseAbs().maxCoeff() <= (std::numeric_limits<RealScalar>::min)());
|
/external/eigen/Eigen/src/Eigenvalues/ |
MatrixBaseEigenvalues.h | 127 // then we don't need to compute a maxCoeff() here, comparing the 1st and last ones is enough. 132 .maxCoeff() 155 return eigenvalues().cwiseAbs().maxCoeff();
|
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
Scaling.h | 131 EpsRow = DrRes.maxCoeff(); 133 EpsCol = DcRes.maxCoeff();
|
/external/eigen/unsupported/test/ |
cxx11_tensor_forced_eval.cpp | 54 output.rowwise() -= input.colwise().maxCoeff();
|
polynomialsolver.cpp | 132 VERIFY( internal::isApprox( roots.array().abs().maxCoeff(), 144 VERIFY( internal::isApprox( real_roots.array().abs().maxCoeff(), abs(r), psPrec ) ); } 156 VERIFY( internal::isApprox( real_roots.array().maxCoeff(), r, psPrec ) ); }
|
polynomialutils.cpp | 78 _Scalar Max = roots.array().abs().maxCoeff();
|
/external/eigen/Eigen/src/QR/ |
ColPivHouseholderQR_LAPACKE.h | 71 m_maxpivot=m_qr.diagonal().cwiseAbs().maxCoeff(); \
|
/external/eigen/blas/ |
level1_impl.h | 60 if(*incx==1) make_vector(x,*n).cwiseAbs().maxCoeff(&ret); 61 else make_vector(x,*n,std::abs(*incx)).cwiseAbs().maxCoeff(&ret);
|