/external/eigen/Eigen/src/PardisoSupport/ |
H A D | PardisoSupport.h | 167 Derived& compute(const MatrixType& matrix); 171 * \sa compute() 185 * \sa compute() 285 Derived& PardisoImpl<Derived>::compute(const MatrixType& a) 417 using Base::compute; 430 compute(matrix); 471 using Base::compute; 484 compute(matrix); 531 using Base::compute; 545 compute(matri [all...] |
/external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
H A D | MatrixFunctionAtomic.h | 35 * \param[in] f matrix function to compute. 43 MatrixType compute(const MatrixType& A); 71 MatrixType MatrixFunctionAtomic<MatrixType>::compute(const MatrixType& A) function in class:Eigen::MatrixFunctionAtomic
|
H A D | MatrixPower.h | 29 { m_pow.compute(res, m_p); } 68 void compute(MatrixType& res) const; 77 void MatrixPowerAtomic<MatrixType>::compute(MatrixType& res) const function in class:Eigen::MatrixPowerAtomic 168 MatrixSquareRootTriangular<MatrixType>(T).compute(sqrtT); 266 * Therefore, if you want to compute multiple (>= 2) matrix powers 318 void compute(ResultType& res, RealScalar p); 356 void MatrixPower<MatrixType>::compute(ResultType& res, RealScalar p) function in class:Eigen::MatrixPower 420 MatrixPowerAtomic<ComplexMatrix>(m_T, p).compute(m_fT); 480 { MatrixPower<PlainObject>(m_A.eval()).compute(res, m_p); }
|
H A D | MatrixFunction.h | 29 * \p AtomicType and uses these results to compute the matrix function of the whole matrix. The class 30 * \p AtomicType should have a \p compute() member function for computing the matrix function of a block. 47 * changed (or destroyed) before compute() is called. 60 void compute(ResultType &result); 102 void compute(ResultType& result) function in class:Eigen::MatrixFunction 107 mf.compute(Cresult); 144 template <typename ResultType> void compute(ResultType& result); 202 void MatrixFunction<MatrixType,AtomicType,1>::compute(ResultType& result) function in class:Eigen::MatrixFunction 372 block(m_fT, i, i) = m_atomic.compute(block(m_T, i, i)); 395 // compute (blockInde [all...] |
/external/eigen/unsupported/Eigen/src/SVD/ |
H A D | SVDBase.h | 90 SVDBase& compute(const MatrixType& matrix, unsigned int computationOptions); 96 * This method uses the current \a computationOptions, as already passed to the constructor or to compute(const MatrixType&, unsigned int). 98 //virtual SVDBase& compute(const MatrixType& matrix) = 0; 99 SVDBase& compute(const MatrixType& matrix); 113 eigen_assert(computeU() && "This SVD decomposition didn't compute U. Did you ask for it?"); 129 eigen_assert(computeV() && "This SVD decomposition didn't compute V. Did you ask for it?");
|
H A D | JacobiSVD.h | 91 m_qr.compute(matrix); 138 m_qr.compute(m_adjoint); 176 m_qr.compute(matrix); 231 m_qr.compute(m_adjoint); 276 m_qr.compute(matrix); 330 m_qr.compute(m_adjoint); 527 * perform decompositions via JacobiSVD::compute(const MatrixType&). 559 compute(matrix, computationOptions); 572 SVDBase<MatrixType>& compute(const MatrixType& matrix, unsigned int computationOptions); 578 * This method uses the current \a computationOptions, as already passed to the constructor or to compute(cons 580 SVDBase<MatrixType>& compute(const MatrixType& matrix) function in class:Eigen::JacobiSVD 640 JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType& matrix, unsigned int computationOptions) function in class:Eigen::JacobiSVD [all...] |
/external/llvm/lib/CodeGen/ |
H A D | RegisterClassInfo.cpp | 76 /// compute - Compute the preferred allocation order for RC with reserved 79 void RegisterClassInfo::compute(const TargetRegisterClass *RC) const { function in class:RegisterClassInfo 168 // For efficiency, only compute the set order for the largest set. 175 compute(RC);
|
/external/eigen/Eigen/src/Eigenvalues/ |
H A D | ComplexSchur_MKL.h | 45 ComplexSchur<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW> >::compute(const Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW>& matrix, bool computeU) \
|
H A D | RealSchur_MKL.h | 45 RealSchur<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW> >::compute(const Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW>& matrix, bool computeU) \
|
H A D | SelfAdjointEigenSolver_MKL.h | 45 SelfAdjointEigenSolver<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW> >::compute(const Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW>& matrix, int options) \
|
/external/eigen/test/eigen2/ |
H A D | eigen2_qr.cpp | 42 hess.compute(b);
|
H A D | eigen2_svd.cpp | 85 s.compute(m);
|
/external/eigen/test/ |
H A D | hessenberg.cpp | 32 // Test whether compute() and constructor returns same result 35 cs1.compute(A);
|
H A D | sparseqr.cpp | 56 solver.compute(A);
|
/external/eigen/Eigen/src/SVD/ |
H A D | JacobiSVD.h | 91 m_qr.compute(matrix); 138 m_qr.compute(m_adjoint); 176 m_qr.compute(matrix); 231 m_qr.compute(m_adjoint); 276 m_qr.compute(matrix); 330 m_qr.compute(m_adjoint); 534 * perform decompositions via JacobiSVD::compute(const MatrixType&). 578 compute(matrix, computationOptions); 591 JacobiSVD& compute(const MatrixType& matrix, unsigned int computationOptions); 597 * This method uses the current \a computationOptions, as already passed to the constructor or to compute(cons 599 JacobiSVD& compute(const MatrixType& matrix) function in class:Eigen::JacobiSVD 817 JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType& matrix, unsigned int computationOptions) function in class:Eigen::JacobiSVD [all...] |
H A D | JacobiSVD_MKL.h | 45 JacobiSVD<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW, Dynamic, Dynamic>, ColPivHouseholderQRPreconditioner>::compute(const Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW, Dynamic, Dynamic>& matrix, unsigned int computationOptions) \
|
/external/eigen/Eigen/src/CholmodSupport/ |
H A D | CholmodSupport.h | 184 compute(matrix); 212 Derived& compute(const MatrixType& matrix) function in class:Eigen::CholmodBase 221 * \sa compute() 235 * \sa compute() 295 eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or symbolic()/numeric()"); 317 eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or symbolic()/numeric()"); 398 compute(matrix); 445 compute(matrix); 490 compute(matrix); 537 compute(matri [all...] |
/external/mockito/cglib-and-asm/src/org/mockito/asm/ |
H A D | MethodWriter.java | 100 * @see #compute
108 * @see #compute
115 * @see #compute
338 * Fields for the control flow graph analysis algorithm (used to compute the
354 private final int compute;
field in class:MethodWriter 442 this.compute = computeFrames ? FRAMES : (computeMaxs ? MAXS : NOTHING);
547 if (!ClassReader.FRAMES || compute == FRAMES) {
640 if (compute == FRAMES) {
662 if (compute == FRAMES) {
685 if (compute [all...] |
/external/chromium_org/third_party/skia/bench/ |
H A D | bench_util.py | 115 def compute(self): member in class:_ListAlgorithm 237 # per-tile config; compute representation for each tile 239 _ListAlgorithm(iters, representation).compute() 249 per_iter_time, representation).compute()
|
/external/eigen/Eigen/src/QR/ |
H A D | HouseholderQR.h | 66 * perform decompositions via HouseholderQR::compute(const MatrixType&). 85 * the method compute(). It is a short cut for: 89 * qr.compute(matrix); 92 * \sa compute() 100 compute(matrix); 151 HouseholderQR& compute(const MatrixType& matrix); 344 HouseholderQR<MatrixType>& HouseholderQR<MatrixType>::compute(const MatrixType& matrix) function in class:Eigen::HouseholderQR
|
H A D | ColPivHouseholderQR_MKL.h | 46 ColPivHouseholderQR<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW, Dynamic, Dynamic> >::compute( \
|
/external/skia/bench/ |
H A D | bench_util.py | 115 def compute(self): member in class:_ListAlgorithm 237 # per-tile config; compute representation for each tile 239 _ListAlgorithm(iters, representation).compute() 249 per_iter_time, representation).compute()
|
/external/eigen/bench/spbench/ |
H A D | sp_solver.cpp | 95 solver.compute(A);
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | ComputingConcurrentHashMap.java | 151 return compute(key, hash, e, computingValueReference); 171 V compute(K key, int hash, ReferenceEntry<K, V> e, method in class:ComputingConcurrentHashMap.ComputingSegment 182 value = computingValueReference.compute(key, hash); 350 V compute(K key, int hash) throws ExecutionException { method in class:ComputingConcurrentHashMap.ComputingValueReference
|
/external/javassist/src/main/javassist/compiler/ast/ |
H A D | IntConst.java | 44 public ASTree compute(int op, ASTree right) { method in class:IntConst
|