| /external/clang/test/Analysis/inlining/ |
| eager-reclamation-path-notes.c | 10 int compute() { function
21 use(p, compute());
33 use2(p, compute());
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| RecursiveAction.java | 26 * protected void compute() {
59 * protected void compute() {
109 * protected void compute() {
143 protected abstract void compute(); method in class:RecursiveAction
161 compute(); method
|
| RecursiveTask.java | 18 * Integer compute() {
24 * return f2.compute() + f1.join();
28 * However, besides being a dumb way to compute Fibonacci functions
51 protected abstract V compute(); method in class:RecursiveTask
65 result = compute();
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| GeneralizedSelfAdjointEigenSolver.h | 35 * Call the function compute() to compute the eigenvalues and eigenvectors of
59 * perform decompositions via compute(). This constructor
71 * intends to perform decompositions via compute(). The \p size
75 * \sa compute() for an example
90 * This constructor calls compute(const MatrixType&, const MatrixType&, int)
91 * to compute the eigenvalues and (if requested) the eigenvectors of the
105 * \sa compute(const MatrixType&, const MatrixType&, int)
111 compute(matA, matB, options);
139 * The implementation uses LLT to compute the Cholesky decompositio
164 compute(const MatrixType& matA, const MatrixType& matB, int options) function in class:Eigen::GeneralizedSelfAdjointEigenSolver
[all...] |
| 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
238 ComplexEigenSolver<MatrixType>& ComplexEigenSolver<MatrixType>::compute(const MatrixType& matrix, bool computeEigenvectors) function in class:Eigen::ComplexEigenSolver
[all...] |
| HessenbergDecomposition.h | 45 * Call the function compute() to compute the Hessenberg decomposition of a
94 * perform decompositions via compute(). The \p size parameter is only
98 * \sa compute() for an example.
113 * This constructor calls compute() to compute the Hessenberg
150 HessenbergDecomposition& compute(const MatrixType& matrix) function in class:Eigen::HessenbergDecomposition
169 * or the member function compute(const MatrixType&) has been called
170 * before to compute the Hessenberg decomposition of a matrix.
189 * or the member function compute(const MatrixType&) has been calle
[all...] |
| /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/llvm/lib/CodeGen/ |
| RegisterClassInfo.cpp | 72 /// compute - Compute the preferred allocation order for RC with reserved
75 void RegisterClassInfo::compute(const TargetRegisterClass *RC) const { function in class:RegisterClassInfo
|
| /external/webkit/Source/WebCore/platform/graphics/gpu/ |
| LoopBlinnTextureCoords.cpp | 37 LoopBlinnTextureCoords::Result LoopBlinnTextureCoords::compute(const LoopBlinnClassifier::Result& classification, LoopBlinnConstants::FillSide sideToFill) function in class:WebCore::LoopBlinnTextureCoords
|
| /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
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IncompleteLU.h | 31 compute(mat);
38 IncompleteLU& compute(const MatrixType& mat) function in class:Eigen::IncompleteLU
|
| 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:Scaling
136 /** Compute the left and right vectors to scale the vectors
139 * \sa compute()
143 compute (mat);
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunctionAtomic.h | 35 * \param[in] f matrix function to compute.
39 /** \brief Compute matrix function of atomic matrix
43 MatrixType compute(const MatrixType& A);
71 MatrixType MatrixFunctionAtomic<MatrixType>::compute(const MatrixType& A) function in class:Eigen::MatrixFunctionAtomic
93 /** \brief Compute \c m_mu. */
|
| MatrixExponential.h | 36 * changed (or destroyed) before compute() is called.
47 void compute(ResultType &result);
55 /** \brief Compute the (3,3)-Padé approximant to the exponential.
64 /** \brief Compute the (5,5)-Padé approximant to the exponential.
73 /** \brief Compute the (7,7)-Padé approximant to the exponential.
82 /** \brief Compute the (9,9)-Padé approximant to the exponential.
91 /** \brief Compute the (13,13)-Padé approximant to the exponential.
100 /** \brief Compute the (17,17)-Padé approximant to the exponential.
111 /** \brief Compute Padé approximant to the exponential.
126 /** \brief Compute Padé approximant to the exponential
183 void MatrixExponential<MatrixType>::compute(ResultType &result) function in class:Eigen::MatrixExponential
[all...] |
| /external/skia/bench/ |
| bench_util.py | 80 def compute(self): member in class:_ListAlgorithm
104 iters, representation).compute())
|
| /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/Polynomials/ |
| PolynomialSolver.h | 319 * Currently a QR algorithm is used to compute the eigenvalues of the companion matrix of
320 * the polynomial to compute its roots.
342 void compute( const OtherPolynomial& poly ) function in class:Eigen::PolynomialSolver
347 m_eigenSolver.compute( companion.denseMatrix() );
354 compute( poly ); }
374 void compute( const OtherPolynomial& poly ) function in class:Eigen::PolynomialSolver
|
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineInplaceLU.h | 34 /** Creates a LU object and compute the respective factorization of \a matrix using
39 m_lu.IsRowMajor ? computeRowMajor() : compute();
89 void compute();
120 void SkylineInplaceLU<MatrixType>::compute() { function in class:Eigen::SkylineInplaceLU
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| MapMaker.java | 138 result = compute(key);
143 private V compute(K key) { method in class:MapMaker.ExpiringComputingMap
|
| /external/javassist/src/main/javassist/bytecode/stackmap/ |
| Liveness.java | 29 * To correctly compute a stack map table, all the arguments must
34 public void compute(CodeIterator ci, TypedBlock[] blocks, int maxLocals, method in class:Liveness
|
| /external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/textures/ |
| 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)
160 noiseDepthFunctions[m].compute(xyz, turb); method
189 void compute(float[] xyz, float turbulence); method in interface:TextureGeneratorMagic.NoiseDepthFunction
[all...] |
| /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/CXX/temp/temp.decls/temp.friend/ |
| p1.cpp | 104 static T compute(Bool b) { function in class:test3::User
|
| /external/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 28 * \param MatrixType the type of the matrix of which to compute the LDL^T Cholesky decomposition
70 * perform decompositions via LDLT::compute(const MatrixType&).
98 compute(matrix);
196 LDLT& compute(const MatrixType& matrix);
230 * Used to compute and store the Cholesky decomposition A = L D L^* = U^* D U.
425 /** Compute / recompute the LDLT decomposition A = L D L^* = U^* D U of \a matrix
428 LDLT<MatrixType,_UpLo>& LDLT<MatrixType,_UpLo>::compute(const MatrixType& a) function in class:Eigen::LDLT
445 /** Update the LDLT decomposition: given A = L D L^T, efficiently compute the decomposition of A + sigma w w^T.
|
