/external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/textures/ |
D | TextureGeneratorMagic.java | 54 public void compute(float[] xyz, float turbulence) { 60 public void compute(float[] xyz, float turbulence) { 66 public void compute(float[] xyz, float turbulence) { 72 public void compute(float[] xyz, float turbulence) { 78 public void compute(float[] xyz, float turbulence) { 84 public void compute(float[] xyz, float turbulence) { 90 public void compute(float[] xyz, float turbulence) { 96 public void compute(float[] xyz, float turbulence) { 102 public void compute(float[] xyz, float turbulence) { 108 public void compute(float[] xyz, float turbulence) { [all …]
|
/external/eigen/unsupported/test/ |
D | svd_common.h | 161 svd.compute(a, 0); in svd_verify_assert() 169 svd.compute(a, ComputeThinU); in svd_verify_assert() 173 svd.compute(a, ComputeThinV); in svd_verify_assert() 180 VERIFY_RAISES_ASSERT(svd.compute(a, ComputeThinU)) in svd_verify_assert() 181 VERIFY_RAISES_ASSERT(svd.compute(a, ComputeThinV)) in svd_verify_assert() 203 svd.compute(MatrixType::Constant(10,10,some_inf), ComputeFullU | ComputeFullV); in svd_inf_nan() 207 svd.compute(MatrixType::Constant(10,10,some_nan), ComputeFullU | ComputeFullV); in svd_inf_nan() 211 svd.compute(m, ComputeFullU | ComputeFullV); in svd_inf_nan() 215 svd.compute(m, ComputeFullU | ComputeFullV); in svd_inf_nan() 229 svd.compute(m); in svd_preallocate() [all …]
|
/external/eigen/test/ |
D | nomalloc.cpp | 130 Eigen::LLT<Matrix> LLT; LLT.compute(A); in ctms_decompositions() 133 Eigen::LDLT<Matrix> LDLT; LDLT.compute(A); in ctms_decompositions() 138 Eigen::HessenbergDecomposition<ComplexMatrix> hessDecomp; hessDecomp.compute(complexA); in ctms_decompositions() 139 Eigen::ComplexSchur<ComplexMatrix> cSchur(size); cSchur.compute(complexA); in ctms_decompositions() 140 Eigen::ComplexEigenSolver<ComplexMatrix> cEigSolver; cEigSolver.compute(complexA); in ctms_decompositions() 141 Eigen::EigenSolver<Matrix> eigSolver; eigSolver.compute(A); in ctms_decompositions() 142 Eigen::SelfAdjointEigenSolver<Matrix> saEigSolver(size); saEigSolver.compute(saA); in ctms_decompositions() 143 Eigen::Tridiagonalization<Matrix> tridiag; tridiag.compute(saA); in ctms_decompositions() 146 Eigen::PartialPivLU<Matrix> ppLU; ppLU.compute(A); in ctms_decompositions() 149 Eigen::FullPivLU<Matrix> fpLU; fpLU.compute(A); in ctms_decompositions() [all …]
|
D | jacobisvd.cpp | 262 svd.compute(a, 0); in jacobisvd_verify_assert() 270 svd.compute(a, ComputeThinU); in jacobisvd_verify_assert() 275 svd.compute(a, ComputeThinV); in jacobisvd_verify_assert() 281 VERIFY_RAISES_ASSERT(svd_fullqr.compute(a, ComputeFullU|ComputeThinV)) in jacobisvd_verify_assert() 282 VERIFY_RAISES_ASSERT(svd_fullqr.compute(a, ComputeThinU|ComputeThinV)) in jacobisvd_verify_assert() 283 VERIFY_RAISES_ASSERT(svd_fullqr.compute(a, ComputeThinU|ComputeFullV)) in jacobisvd_verify_assert() 287 VERIFY_RAISES_ASSERT(svd.compute(a, ComputeThinU)) in jacobisvd_verify_assert() 288 VERIFY_RAISES_ASSERT(svd.compute(a, ComputeThinV)) in jacobisvd_verify_assert() 322 svd.compute(MatrixType::Constant(10,10,some_inf), ComputeFullU | ComputeFullV); in jacobisvd_inf_nan() 326 svd.compute(MatrixType::Constant(10,10,nan), ComputeFullU | ComputeFullV); in jacobisvd_inf_nan() [all …]
|
D | schur_complex.cpp | 43 cs1.compute(A); in schur() 52 cs3.setMaxIterations(ComplexSchur<MatrixType>::m_maxIterationsPerRow * size).compute(A); in schur() 56 cs3.setMaxIterations(1).compute(A); in schur() 62 cs3.setMaxIterations(1).compute(Atriangular); // triangular matrices do not need any iterations in schur()
|
D | schur_real.cpp | 62 rs1.compute(A); in schur() 71 rs3.setMaxIterations(RealSchur<MatrixType>::m_maxIterationsPerRow * size).compute(A); in schur() 76 rs3.setMaxIterations(1).compute(A); in schur() 83 rs3.setMaxIterations(1).compute(Atriangular); // triangular matrices do not need any iterations in schur()
|
D | eigensolver_selfadjoint.cpp | 74 eiSymmGen.compute(symmC, symmB,Ax_lBx); in selfadjointeigensolver() 80 eiSymmGen.compute(symmC, symmB,BAx_lx); in selfadjointeigensolver() 86 eiSymmGen.compute(symmC, symmB,ABx_lx); in selfadjointeigensolver() 92 eiSymm.compute(symmC); in selfadjointeigensolver() 107 eiSymmUninitialized.compute(symmA, false); in selfadjointeigensolver()
|
/external/libxml2/result/c14n/with-comments/ |
D | example-4 | 5 <compute>value>"0" && value<"10" ?"valid":"error"</compute> 6 …<compute expr="value>"0" && value<"10" ?"valid":"err…
|
/external/libxml2/result/c14n/1-1-without-comments/ |
D | example-4 | 5 <compute>value>"0" && value<"10" ?"valid":"error"</compute> 6 …<compute expr="value>"0" && value<"10" ?"valid":"err…
|
/external/libxml2/result/c14n/without-comments/ |
D | example-4 | 5 <compute>value>"0" && value<"10" ?"valid":"error"</compute> 6 …<compute expr="value>"0" && value<"10" ?"valid":"err…
|
/external/eigen/Eigen/src/Eigenvalues/ |
D | GeneralizedSelfAdjointEigenSolver.h | 111 compute(matA, matB, options); 154 GeneralizedSelfAdjointEigenSolver& compute(const MatrixType& matA, const MatrixType& matB, 164 compute(const MatrixType& matA, const MatrixType& matB, int options) in compute() function 189 Base::compute(matC, computeEigVecs ? ComputeEigenvectors : EigenvaluesOnly ); in compute() 202 Base::compute(matC, computeEigVecs ? ComputeEigenvectors : EigenvaluesOnly); in compute() 215 Base::compute(matC, computeEigVecs ? ComputeEigenvectors : EigenvaluesOnly); in compute()
|
/external/deqp/doc/testspecs/GLES31/ |
D | functional.compute.basic.txt | 22 + dEQP-GLES31.functional.compute.basic.* 25 + Empty compute shader 26 + Single and multiple compute shader invocations (1 to 4k invocations) 56 The objective of basic compute tests is to provide a simplest possible test 57 case for each of the major compute-related features. The tests will not try to 62 compute shader. One or more (in API-level barrier tests) compute invocations
|
D | functional.compute.indirect_dispatch.txt | 22 + dEQP-GLES31.functional.compute.indirect_dispatch.* 32 + Buffers generated using compute shaders 43 glBufferData(). In gen_in_compute cases a compute shader is first dispatches, 45 as a SSBO. Memory barrier is issued after the first compute shader in 48 Actual indirect compute tasks use a simple compute shader, that has access to
|
/external/clang/test/Analysis/inlining/ |
D | eager-reclamation-path-notes.c | 10 int compute() { in compute() function 21 use(p, compute()); in testSimple() 33 use2(p, compute()); in passThrough()
|
/external/javassist/src/main/javassist/compiler/ast/ |
D | DoubleConst.java | 44 public ASTree compute(int op, ASTree right) { in compute() method in DoubleConst 61 return compute(op, this.value, right.value, newType); in compute0() 65 return compute(op, this.value, (double)right.value, this.type); in compute0() 68 private static DoubleConst compute(int op, double value1, double value2, in compute() method in DoubleConst
|
/external/linux-tools-perf/src/tools/perf/Documentation/ |
D | perf-diff.txt | 76 --compute:: 90 Specify compute sorting column number. 114 baseline/A compute/B compute/C samples 125 baseline/B compute/A compute/C samples 136 baseline/C compute/B compute/A samples
|
/external/eigen/Eigen/src/PaStiXSupport/ |
D | PaStiXSupport.h | 258 void compute(ColSpMatrix& mat); 315 void PastixBase<Derived>::compute(ColSpMatrix& mat) 448 compute(matrix); 455 void compute (const MatrixType& matrix) 460 Base::compute(temp); 558 compute(matrix); 564 void compute (const MatrixType& matrix) 568 Base::compute(temp); 639 compute(matrix); 645 void compute (const MatrixType& matrix) [all …]
|
/external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
D | MatrixSquareRoot.h | 53 template <typename ResultType> void compute(ResultType &result); 80 void MatrixSquareRootQuasiTriangular<MatrixType>::compute(ResultType &result) in compute() function 274 template <typename ResultType> void compute(ResultType &result); 282 void MatrixSquareRootTriangular<MatrixType>::compute(ResultType &result) in compute() function 333 template <typename ResultType> void compute(ResultType &result); 350 template <typename ResultType> void compute(ResultType &result) in compute() function 359 MatrixSquareRootQuasiTriangular<MatrixType>(T).compute(sqrtT); in compute() 383 template <typename ResultType> void compute(ResultType &result) in compute() function 392 MatrixSquareRootTriangular<MatrixType>(T).compute(sqrtT); in compute() 437 me.compute(result); in evalTo()
|
/external/clang/test/Analysis/ |
D | temporaries.cpp | 175 extern bool compute(bool); in testConsistencyNested() 186 if (compute(i == 5 && in testConsistencyNested() 187 (i == 4 || compute(true) || in testConsistencyNested() 188 compute(i == 5 && (i == 4 || check(NoReturnDtor()))))) || in testConsistencyNested() 193 if (compute(i == 5 && in testConsistencyNested() 195 compute(i == 5 && (i == 4 || check(NoReturnDtor()))))) || in testConsistencyNested()
|
/external/eigen/unsupported/Eigen/src/Eigenvalues/ |
D | ArpackSelfAdjointEigenSolver.h | 111 compute(A, B, nbrEigenvalues, eigs_sigma, options, tol); in m_eivec() 146 compute(A, nbrEigenvalues, eigs_sigma, options, tol); in m_eivec() 173 ArpackGeneralizedSelfAdjointEigenSolver& compute(const MatrixType& A, const MatrixType& B, 199 ArpackGeneralizedSelfAdjointEigenSolver& compute(const MatrixType& A, 335 ::compute(const MatrixType& A, Index nbrEigenvalues, in compute() function 339 compute(A, B, nbrEigenvalues, eigs_sigma, options, tol); in compute() 348 ::compute(const MatrixType& A, const MatrixType& B, Index nbrEigenvalues, in compute() function 476 OP.compute(B); in compute() 482 OP.compute(A); in compute() 494 OP.compute(AminusSigmaB); in compute() [all …]
|
/external/eigen/Eigen/src/SparseCholesky/ |
D | SimplicialCholesky.h | 58 derived().compute(matrix); in SimplicialCholeskyBase() 185 void compute(const MatrixType& matrix) in compute() function 340 SimplicialLLT& compute(const MatrixType& matrix) 342 Base::template compute<false>(matrix); 435 SimplicialLDLT& compute(const MatrixType& matrix) 437 Base::template compute<true>(matrix); 497 compute(matrix); 527 SimplicialCholesky& compute(const MatrixType& matrix) 530 Base::template compute<true>(matrix); 532 Base::template compute<false>(matrix);
|
/external/eigen/doc/snippets/ |
D | HessenbergDecomposition_compute.cpp | 3 hd.compute(A); 5 hd.compute(2*A); // re-use hd to compute and store decomposition of 2A
|
D | ComplexSchur_compute.cpp | 3 schur.compute(A); 5 schur.compute(A.inverse());
|
D | RealSchur_compute.cpp | 3 schur.compute(A, /* computeU = */ false); 5 schur.compute(A.inverse(), /* computeU = */ false);
|
D | EigenSolver_compute.cpp | 3 es.compute(A, /* computeEigenvectors = */ false); 5 es.compute(A + MatrixXf::Identity(4,4), false); // re-use es to compute eigenvalues of A+I
|