| /frameworks/rs/tests/cppstrided/ |
| Android.mk | 9 compute.cpp
|
| /external/eigen/test/ |
| jacobisvd.cpp | 262 svd.compute(a, 0);
270 svd.compute(a, ComputeThinU);
275 svd.compute(a, ComputeThinV);
281 VERIFY_RAISES_ASSERT(svd_fullqr.compute(a, ComputeFullU|ComputeThinV))
282 VERIFY_RAISES_ASSERT(svd_fullqr.compute(a, ComputeThinU|ComputeThinV))
283 VERIFY_RAISES_ASSERT(svd_fullqr.compute(a, ComputeThinU|ComputeFullV))
287 VERIFY_RAISES_ASSERT(svd.compute(a, ComputeThinU))
288 VERIFY_RAISES_ASSERT(svd.compute(a, ComputeThinV))
322 svd.compute(MatrixType::Constant(10,10,some_inf), ComputeFullU | ComputeFullV);
326 svd.compute(MatrixType::Constant(10,10,some_nan), ComputeFullU | ComputeFullV)
[all...] |
| schur_complex.cpp | 40 // Test whether compute() and constructor returns same result
43 cs1.compute(A);
52 cs3.setMaxIterations(ComplexSchur<MatrixType>::m_maxIterationsPerRow * size).compute(A);
56 cs3.setMaxIterations(1).compute(A);
62 cs3.setMaxIterations(1).compute(Atriangular); // triangular matrices do not need any iterations
|
| schur_real.cpp | 59 // Test whether compute() and constructor returns same result
62 rs1.compute(A);
71 rs3.setMaxIterations(RealSchur<MatrixType>::m_maxIterationsPerRow * size).compute(A);
76 rs3.setMaxIterations(1).compute(A);
83 rs3.setMaxIterations(1).compute(Atriangular); // triangular matrices do not need any iterations
|
| eigensolver_complex.cpp | 60 ei2.setMaxIterations(ComplexSchur<MatrixType>::m_maxIterationsPerRow * rows).compute(a);
65 ei2.setMaxIterations(1).compute(a);
98 eig.compute(a, false);
|
| eigensolver_generic.cpp | 48 ei2.setMaxIterations(RealSchur<MatrixType>::m_maxIterationsPerRow * rows).compute(a);
53 ei2.setMaxIterations(1).compute(a);
84 eig.compute(a, false);
|
| eigensolver_selfadjoint.cpp | 60 eiSymmGen.compute(symmA, symmB,Ax_lBx);
66 eiSymmGen.compute(symmA, symmB,BAx_lx);
72 eiSymmGen.compute(symmA, symmB,ABx_lx);
92 eiSymmUninitialized.compute(symmA, false);
|
| spqr_support.cpp | 40 solver.compute(A);
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| BasicPreconditioners.h | 48 compute(mat);
78 DiagonalPreconditioner& compute(const MatType& mat) function in class:Eigen::DiagonalPreconditioner
141 IdentityPreconditioner& compute(const MatrixType& ) { return *this; } function in class:Eigen::IdentityPreconditioner
|
| IterativeSolverBase.h | 45 * by a call to compute().
49 * this class becomes invalid. Call compute() to update it with the new
55 compute(A);
80 * this class becomes invalid. Call compute() to update it with the new
95 * Currently, this function mostly initialized/compute the preconditioner. In the future
100 * this class becomes invalid. Call compute() to update it with the new
103 Derived& compute(const MatrixType& A) function in class:Eigen::IterativeSolverBase
106 m_preconditioner.compute(A);
164 * \sa compute()
177 * \sa compute()
[all...] |
| /external/eigen/doc/snippets/ |
| ComplexEigenSolver_compute.cpp | 5 ces.compute(A);
|
| RealQZ_compute.cpp | 4 qz.compute(A,B); // A = Q S Z, B = Q T Z
|
| /external/chromium_org/third_party/libsrtp/srtp/crypto/include/ |
| auth.h | 83 (((a)->type)->compute((a)->state, (buf), (len), (a)->out_len, (res)))
127 auth_compute_func compute; member in struct:auth_type_t
|
| /external/srtp/crypto/include/ |
| auth.h | 81 (((a)->type)->compute((a)->state, (buf), (len), (a)->out_len, (res)))
125 auth_compute_func compute; member in struct:auth_type_t
|
| /external/clang/test/Analysis/ |
| temporaries.cpp | 174 extern bool compute(bool);
185 if (compute(i == 5 &&
186 (i == 4 || compute(true) ||
187 compute(i == 5 && (i == 4 || check(NoReturnDtor()))))) ||
192 if (compute(i == 5 &&
194 compute(i == 5 && (i == 4 || check(NoReturnDtor()))))) ||
|
| /external/eigen/Eigen/src/SVD/ |
| UpperBidiagonalization.h | 51 * perform decompositions via Bidiagonalization::compute(const MatrixType&).
60 compute(matrix);
63 UpperBidiagonalization& compute(const MatrixType& matrix);
89 UpperBidiagonalization<_MatrixType>& UpperBidiagonalization<_MatrixType>::compute(const _MatrixType& matrix) function in class:Eigen::internal::UpperBidiagonalization
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| Scaling.h | 28 * // Compute the left and right scaling vectors. The matrix is equilibrated at output
60 compute(matrix);
66 * Compute the left and right diagonal matrices to scale the input matrix @p mat
72 void compute (const MatrixType& mat) function in class:Eigen::IterScaling
136 /** Compute the left and right vectors to scale the vectors
139 * \sa compute()
143 compute (mat);
|
| IncompleteLU.h | 31 compute(mat);
38 IncompleteLU& compute(const MatrixType& mat) function in class:Eigen::IncompleteLU
|
| /external/eigen/Eigen/src/PaStiXSupport/ |
| PaStiXSupport.h | 145 * \sa compute()
225 * \sa compute()
242 // Compute the ordering and the symbolic factorization
245 // Compute the numerical factorization
258 void compute(ColSpMatrix& mat);
315 void PastixBase<Derived>::compute(ColSpMatrix& mat) function in class:Eigen::PastixBase
448 compute(matrix);
450 /** Compute the LU supernodal factorization of \p matrix.
455 void compute (const MatrixType& matrix) function in class:Eigen::PastixLU
460 Base::compute(temp)
564 void compute (const MatrixType& matrix) function in class:Eigen::PastixLLT
645 void compute (const MatrixType& matrix) function in class:Eigen::PastixLDLT
[all...] |
| /external/eigen/unsupported/Eigen/src/Eigenvalues/ |
| ArpackSelfAdjointEigenSolver.h | 67 * perform decompositions via compute().
85 * \param[in] nbrEigenvalues The number of eigenvalues / eigenvectors to compute.
96 * This constructor calls compute(const MatrixType&, const MatrixType&, Index, string, int, RealScalar)
97 * to compute the eigenvalues of the matrix \p A with respect to \p B. The eigenvectors are computed if
111 compute(A, B, nbrEigenvalues, eigs_sigma, options, tol);
119 * \param[in] nbrEigenvalues The number of eigenvalues / eigenvectors to compute.
130 * This constructor calls compute(const MatrixType&, Index, string, int, RealScalar)
131 * to compute the eigenvalues of the matrix \p A. The eigenvectors are computed if
146 compute(A, nbrEigenvalues, eigs_sigma, options, tol);
154 * \param[in] nbrEigenvalues The number of eigenvalues / eigenvectors to compute
335 ::compute(const MatrixType& A, Index nbrEigenvalues, function in class:Eigen::ArpackGeneralizedSelfAdjointEigenSolver
348 ::compute(const MatrixType& A, const MatrixType& B, Index nbrEigenvalues, function in class:Eigen::ArpackGeneralizedSelfAdjointEigenSolver
[all...] |
| /external/chromium_org/native_client_sdk/src/examples/api/core/ |
| example.js | 37 function setStats(nacl, compute, total) {
43 statRoundEl.textContent = (compute / itrMax) + ' ms';
|
| /external/chromium_org/third_party/mesa/src/docs/ |
| MESA_pixmap_colormap.spec | 34 in order to compute pixel values during rendering.
65 to compute pixel values from RGB values Mesa requires a colormap.
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| ComplexEigenSolver.h | 38 * The main function in this class is compute(), which computes the
90 * perform decompositions via compute().
123 * This constructor calls compute() to compute the eigendecomposition.
133 compute(matrix, computeEigenvectors);
142 * function compute(const MatrixType& matrix, bool) has been called before
143 * to compute the eigendecomposition of a matrix, and
169 * function compute(const MatrixType& matrix, bool) has been called before
170 * to compute the eigendecomposition of a matrix.
202 * compute the eigenvalues and eigenvectors
252 ComplexEigenSolver<MatrixType>::compute(const MatrixType& matrix, bool computeEigenvectors) function in class:Eigen::ComplexEigenSolver
[all...] |
| GeneralizedEigenSolver.h | 44 * Call the function compute() to compute the generalized eigenvalues and eigenvectors of
113 * perform decompositions via EigenSolver::compute(const MatrixType&, bool).
115 * \sa compute() for an example.
143 * This constructor calls compute() to compute the generalized eigenvalues
146 * \sa compute()
158 compute(A, B, computeEigenvectors);
167 * compute(const MatrixType&, const MatrixType& bool) has been called before, and
190 * compute(const MatrixType&,const MatrixType&,bool) has been called before
291 GeneralizedEigenSolver<MatrixType>::compute(const MatrixType& A, const MatrixType& B, bool computeEigenvectors) function in class:Eigen::GeneralizedEigenSolver
[all...] |
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| PolynomialSolver.h | 322 * Currently a QR algorithm is used to compute the eigenvalues of the companion matrix of
323 * the polynomial to compute its roots.
345 void compute( const OtherPolynomial& poly ) function in class:Eigen::PolynomialSolver
350 m_eigenSolver.compute( companion.denseMatrix() );
357 compute( poly ); }
377 void compute( const OtherPolynomial& poly ) function in class:Eigen::PolynomialSolver
|
