| /external/eigen/Eigen/src/Core/ |
| D | StableNorm.h | 20 Scalar maxCoeff = bl.cwiseAbs().maxCoeff(); in stable_norm_kernel() local
22 if(maxCoeff>scale) in stable_norm_kernel()
24 ssq = ssq * numext::abs2(scale/maxCoeff); in stable_norm_kernel()
25 Scalar tmp = Scalar(1)/maxCoeff; in stable_norm_kernel()
31 else if(maxCoeff>NumTraits<Scalar>::highest()) // we got a INF in stable_norm_kernel()
34 scale = maxCoeff; in stable_norm_kernel()
38 scale = maxCoeff; in stable_norm_kernel()
42 else if(maxCoeff!=maxCoeff) // we got a NaN in stable_norm_kernel()
44 scale = maxCoeff; in stable_norm_kernel()
|
| D | Dot.h | 168 RealScalar w = n.cwiseAbs().maxCoeff();
190 RealScalar w = cwiseAbs().maxCoeff();
241 return m.cwiseAbs().maxCoeff();
|
| D | Visitor.h | 244 DenseBase<Derived>::maxCoeff(IndexType* rowPtr, IndexType* colPtr) const
262 DenseBase<Derived>::maxCoeff(IndexType* index) const
|
| /external/eigen/doc/examples/ |
| D | Tutorial_ReductionsVisitorsBroadcasting_reductions_operatornorm.cpp | 13 cout << "1-norm(m) = " << m.cwiseAbs().colwise().sum().maxCoeff() in main()
14 << " == " << m.colwise().lpNorm<1>().maxCoeff() << endl; in main()
16 cout << "infty-norm(m) = " << m.cwiseAbs().rowwise().sum().maxCoeff() in main()
17 << " == " << m.rowwise().lpNorm<1>().maxCoeff() << endl; in main()
|
| D | Tutorial_ReductionsVisitorsBroadcasting_rowwise.cpp | 12 << mat.rowwise().maxCoeff() << std::endl; in main()
|
| D | Tutorial_ReductionsVisitorsBroadcasting_colwise.cpp | 12 << mat.colwise().maxCoeff() << std::endl; in main()
|
| D | tut_arithmetic_redux_basic.cpp | 14 cout << "Here is mat.maxCoeff(): " << mat.maxCoeff() << endl; in main()
|
| D | Tutorial_ReductionsVisitorsBroadcasting_visitors.cpp | 16 float max = m.maxCoeff(&maxRow, &maxCol); in main()
|
| D | Tutorial_ReductionsVisitorsBroadcasting_maxnorm.cpp | 13 float maxNorm = mat.colwise().sum().maxCoeff(&maxIndex); in main()
|
| /external/eigen/test/ |
| D | visitor.cpp | 49 eigen_maxc = m.maxCoeff(&eigen_maxrow,&eigen_maxcol); in matrixVisitor()
57 VERIFY_IS_APPROX(maxc, m.maxCoeff()); in matrixVisitor()
59 eigen_maxc = (m.adjoint()*m).maxCoeff(&eigen_maxrow,&eigen_maxcol); in matrixVisitor()
60 eigen_maxc = (m.adjoint()*m).eval().maxCoeff(&maxrow,&maxcol); in matrixVisitor()
98 eigen_maxc = v.maxCoeff(&eigen_maxidx); in vectorVisitor()
104 VERIFY_IS_APPROX(maxc, v.maxCoeff()); in vectorVisitor()
113 v2.maxCoeff(&eigen_maxidx); in vectorVisitor()
|
| D | redux.cpp | 47 VERIFY_IS_APPROX(m1.real().maxCoeff(), numext::real(maxc)); in matrixRedux()
58 …VERIFY_IS_APPROX(m1.block(r0,c0,r1,c1).real().maxCoeff(), m1.block(r0,c0,r1,c1).real().eval().maxC… in matrixRedux()
104 VERIFY_IS_APPROX(maxc, v.real().head(i).maxCoeff()); in vectorRedux()
121 VERIFY_IS_APPROX(maxc, v.real().tail(size-i).maxCoeff()); in vectorRedux()
138 VERIFY_IS_APPROX(maxc, v.real().segment(i, size-2*i).maxCoeff()); in vectorRedux()
146 VERIFY_RAISES_ASSERT(v.head(0).maxCoeff()); in vectorRedux()
|
| D | cuda_basic.cu | 89 out[i*N+1] = x1.maxCoeff(); in operator ()()
94 out[i*N+6] = x1.colwise().sum().maxCoeff(); in operator ()()
95 out[i*N+7] = x1.rowwise().maxCoeff().sum(); in operator ()()
|
| D | eigensolver_selfadjoint.cpp | 27 RealScalar scaling = m.cwiseAbs().maxCoeff(); in selfadjointeigensolver_essential_check()
31 VERIFY(eiSymm.eigenvalues().cwiseAbs().maxCoeff() <= (std::numeric_limits<RealScalar>::min)()); in selfadjointeigensolver_essential_check()
55 … VERIFY(eiDirect.eigenvalues().cwiseAbs().maxCoeff() <= (std::numeric_limits<RealScalar>::min)()); in selfadjointeigensolver_essential_check()
|
| D | geo_alignedbox.cpp | 123 VERIFY_IS_APPROX(sides[1], box.sizes().maxCoeff() ); in specificTest1()
150 VERIFY_IS_APPROX(sides[1], box.sizes().maxCoeff() ); in specificTest2()
|
| D | geo_homogeneous.cpp | 44 VERIFY_IS_APPROX(v0.homogeneous().maxCoeff(), hv0.maxCoeff()); in homogeneous()
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| D | MatrixBaseEigenvalues.h | 132 .maxCoeff()
155 return eigenvalues().cwiseAbs().maxCoeff();
|
| /external/eigen/unsupported/test/ |
| D | polynomialsolver.cpp | 132 VERIFY( internal::isApprox( roots.array().abs().maxCoeff(), in evalSolverSugarFunction()
144 VERIFY( internal::isApprox( real_roots.array().abs().maxCoeff(), abs(r), psPrec ) ); } in evalSolverSugarFunction()
156 VERIFY( internal::isApprox( real_roots.array().maxCoeff(), r, psPrec ) ); } in evalSolverSugarFunction()
|
| D | cxx11_tensor_forced_eval.cpp | 54 output.rowwise() -= input.colwise().maxCoeff(); in test_const()
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| D | Scaling.h | 131 EpsRow = DrRes.maxCoeff(); in compute()
133 EpsCol = DcRes.maxCoeff(); in compute()
|
| /external/eigen/doc/snippets/ |
| D | PartialRedux_maxCoeff.cpp | 3 cout << "Here is the maximum of each column:" << endl << m.colwise().maxCoeff() << endl;
|
| D | MatrixBase_colwise.cpp | 5 << endl << m.cwiseAbs().colwise().maxCoeff() << endl;
|
| D | MatrixBase_rowwise.cpp | 5 << endl << m.cwiseAbs().rowwise().maxCoeff() << endl;
|
| D | tut_arithmetic_redux_minmax.cpp | 9 int maxOfV = v.maxCoeff(&i);
|
| /external/eigen/blas/ |
| D | level1_impl.h | 60 if(*incx==1) make_vector(x,*n).cwiseAbs().maxCoeff(&ret); in EIGEN_CAT()
61 else make_vector(x,*n,std::abs(*incx)).cwiseAbs().maxCoeff(&ret); in EIGEN_CAT()
|
| /external/webrtc/modules/audio_coding/codecs/isac/fix/source/ |
| D | decode_plc.c | 272 int32_t nHP, pHP, wNoisyHP, wPriodicHP, corr, minCorr, maxCoeff; in WebRtcIsacfix_DecodePlcImpl() local
494 maxCoeff = WebRtcSpl_MaxAbsValueW32( in WebRtcIsacfix_DecodePlcImpl()
499 while( maxCoeff > WEBRTC_SPL_WORD16_MAX ) in WebRtcIsacfix_DecodePlcImpl()
501 maxCoeff >>= 1; in WebRtcIsacfix_DecodePlcImpl()
|