| /external/deqp/external/vulkancts/modules/vulkan/compute/ |
| vktComputeBasicComputeShaderTests.hpp | 23 * \brief Compute Shader Tests
31 namespace compute namespace in namespace:vkt
36 } // compute
|
| vktComputeIndirectComputeDispatchTests.hpp | 23 * \brief Indirect Compute Dispatch tests
31 namespace compute namespace in namespace:vkt
36 } // compute
|
| vktComputeShaderBuiltinVarTests.hpp | 23 * \brief Compute Shader Built-in variable tests.
31 namespace compute namespace in namespace:vkt
34 } // compute
|
| vktComputeTests.hpp | 23 * \brief Compute Shader Tests
31 namespace compute namespace in namespace:vkt
36 } // compute
|
| vktComputeTests.cpp | 21 * \brief Compute Shader Tests
32 namespace compute namespace in namespace:vkt
51 return createTestGroup(testCtx, "compute", "Compute shader tests", createChildren);
54 } // compute
|
| vktComputeTestsUtil.hpp | 23 * \brief Compute tests utility classes
36 namespace compute namespace in namespace:vkt
160 } // compute
|
| /external/universal-tween-engine/java/api/src/aurelienribon/tweenengine/ |
| TweenPath.java | 21 public float compute(float t, float[] points, int pointsCnt); method in interface:TweenPath
|
| TweenEquation.java | 18 public abstract float compute(float t); method in class:TweenEquation
|
| /external/deqp/framework/delibs/decpp/ |
| deSha1.cpp | 39 Sha1 Sha1::compute (size_t size, const void* data) function in class:de::Sha1
|
| /external/universal-tween-engine/java/api/src/aurelienribon/tweenengine/paths/ |
| Linear.java | 10 public float compute(float t, float[] points, int pointsCnt) { method in class:Linear
|
| CatmullRom.java | 10 public float compute(float t, float[] points, int pointsCnt) { method in class:CatmullRom
|
| /external/clang/test/Analysis/inlining/ |
| eager-reclamation-path-notes.c | 10 int compute() { function
21 use(p, compute());
33 use2(p, compute());
[all...] |
| /external/dagger2/producers/src/main/java/dagger/producers/internal/ |
| SetProducer.java | 66 public ListenableFuture<Set<T>> compute(ProducerMonitor unusedMonitor) { method in class:SetProducer
|
| AbstractProducer.java | 31 * An abstract {@link Producer} implementation that memoizes the result of its compute method.
52 protected abstract ListenableFuture<T> compute(ProducerMonitor monitor); method in class:AbstractProducer
63 instance = result = compute(monitor);
65 throw new NullPointerException("compute returned null");
|
| SetOfProducedProducer.java | 68 public ListenableFuture<Set<Produced<T>>> compute(ProducerMonitor unusedMonitor) { method in class:SetOfProducedProducer
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| GeneralizedSelfAdjointEigenSolver.h | 35 * Call the function compute() to compute the eigenvalues and eigenvectors of
58 * perform decompositions via compute(). This constructor
70 * intends to perform decompositions via compute(). The \p size
74 * \sa compute() for an example
89 * This constructor calls compute(const MatrixType&, const MatrixType&, int)
90 * to compute the eigenvalues and (if requested) the eigenvectors of the
104 * \sa compute(const MatrixType&, const MatrixType&, int)
110 compute(matA, matB, options);
138 * The implementation uses LLT to compute the Cholesky decompositio
163 compute(const MatrixType& matA, const MatrixType& matB, int options) function in class:Eigen::GeneralizedSelfAdjointEigenSolver
[all...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| RecursiveAction.java | 55 * protected void compute() {
88 * protected void compute() {
138 * protected void compute() {
171 protected abstract void compute(); method in class:RecursiveAction
189 compute(); method
|
| RecursiveTask.java | 47 * protected Integer compute() {
53 * return f2.compute() + f1.join();
57 * However, besides being a dumb way to compute Fibonacci functions
80 protected abstract V compute(); method in class:RecursiveTask
94 result = compute();
|
| /prebuilts/misc/common/swig/include/2.0.11/chicken/ |
| swigclosprefix.scm | 14 (define-method (compute-getter-and-setter (class <swig-metaclass-$module>) slot allocator)
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IncompleteLU.h | 35 compute(mat);
42 IncompleteLU& compute(const MatrixType& mat) function in class:Eigen::IncompleteLU
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| RegisterClassInfo.cpp | 67 /// compute - Compute the preferred allocation order for RC with reserved
70 void RegisterClassInfo::compute(const TargetRegisterClass *RC) const { function in class:RegisterClassInfo
|
| /external/javassist/src/main/javassist/compiler/ast/ |
| DoubleConst.java | 44 public ASTree compute(int op, ASTree right) { method in class:DoubleConst
61 return compute(op, this.value, right.value, newType);
65 return compute(op, this.value, (double)right.value, this.type);
68 private static DoubleConst compute(int op, double value1, double value2, method in class:DoubleConst
|
| IntConst.java | 44 public ASTree compute(int op, ASTree right) { method in class:IntConst
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| BasicPreconditioners.h | 52 compute(mat);
82 DiagonalPreconditioner& compute(const MatType& mat) function in class:Eigen::DiagonalPreconditioner
141 compute(mat);
153 // Compute the inverse squared-norm of each column of mat
168 LeastSquareDiagonalPreconditioner& compute(const MatType& mat) function in class:Eigen::LeastSquareDiagonalPreconditioner
201 IdentityPreconditioner& compute(const MatrixType& ) { return *this; } function in class:Eigen::IdentityPreconditioner
|
| /external/eigen/bench/ |
| dense_solvers.cpp | 18 solver.compute(A.transpose()*A);
20 solver.compute(A);
25 void compute(Solver &solver, const MatrixType &A) { function
26 solver.compute(A);
64 BENCH(t_qr, tries, rep, compute(qr,A));
65 BENCH(t_cpqr, tries, rep, compute(cpqr,A));
66 BENCH(t_cod, tries, rep, compute(cod,A));
68 BENCH(t_fpqr, tries, rep, compute(fpqr,A));
70 BENCH(t_jsvd, tries, rep, jsvd.compute(A,svd_opt));
72 BENCH(t_bdcsvd, tries, rep, bdcsvd.compute(A,svd_opt))
[all...] |
