/external/eigen/Eigen/src/Cholesky/ |
H A D | LLT.h | 76 * perform decompositions via LLT::compute(const MatrixType&). 93 compute(matrix); 144 LLT& compute(const MatrixType& matrix); 178 * Used to compute and store L 385 LLT<MatrixType,_UpLo>& LLT<MatrixType,_UpLo>::compute(const MatrixType& a) function in class:Eigen::LLT
|
/external/eigen/Eigen/src/LU/ |
H A D | FullPivLU.h | 70 * perform decompositions via LU::compute(const MatrixType&). 84 * \param matrix the matrix of which to compute the LU decomposition. 91 * \param matrix the matrix of which to compute the LU decomposition. 96 FullPivLU& compute(const MatrixType& matrix); 415 compute(matrix); 419 FullPivLU<MatrixType>& FullPivLU<MatrixType>::compute(const MatrixType& matrix) function in class:Eigen::FullPivLU 574 /* Thus, all we need to do is to compute Ker U, and then apply Q. 676 * Step 1: compute c = P * rhs.
|
/external/eigen/Eigen/src/QR/ |
H A D | FullPivHouseholderQR.h | 76 * perform decompositions via FullPivHouseholderQR::compute(const MatrixType&). 107 * the method compute(). It is a short cut for: 111 * qr.compute(matrix); 114 * \sa compute() 126 compute(matrix); 167 FullPivHouseholderQR& compute(const MatrixType& matrix); 408 FullPivHouseholderQR<MatrixType>& FullPivHouseholderQR<MatrixType>::compute(const MatrixType& matrix) function in class:Eigen::FullPivHouseholderQR 567 // compute the product H'_0 H'_1 ... H'_n-1,
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/x86/ |
H A D | vp9_high_intrapred_sse2.asm | 269 ; Get the values to compute the maximum value at this bit depth 307 ; Get the values to compute the maximum value at this bit depth 353 ; Get the values to compute the maximum value at this bit depth 409 ; Get the values to compute the maximum value at this bit depth
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
H A D | IncompleteLUT.h | 119 compute(mat); 149 IncompleteLUT<Scalar>& compute(const MatrixType& amat) function in class:Eigen::IncompleteLUT 213 * \param fillfactor This is used to compute the number @p fill_in of largest elements to keep on each row. 233 internal::minimum_degree_ordering<Scalar, Index>(AtA, m_P); // Then compute the AMD ordering...
|
/external/eigen/Eigen/src/UmfPackSupport/ |
H A D | UmfPackSupport.h | 15 /* TODO extract L, extract U, compute det, etc... */ 144 compute(matrix); 195 void compute(const MatrixType& matrix) function in class:Eigen::UmfPackLU 203 * \sa compute() 216 * \sa compute() 231 * \sa factorize(), compute() 256 * \sa analyzePattern(), compute()
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | MapMaker.java | 655 * @param computingFunction the function used to compute new values 933 V value = compute(key); 939 private V compute(K key) { method in class:MapMaker.NullComputingConcurrentMap 952 * Overrides get() to compute on demand. Also throws an exception when {@code null} is returned
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/ppc/ |
H A D | variance_altivec.asm | 64 ;# Now compute sse. 214 ;# Now compute sse.
|
/external/clang/test/CXX/temp/temp.decls/temp.friend/ |
H A D | p1.cpp | 104 static T compute(Bool b) { function in class:test3::User
|
/external/clang/utils/TableGen/ |
H A D | ClangDiagnosticsEmitter.cpp | 316 void compute(VecOrSet DiagsInPedantic, 368 // Lazily compute the threshold value for the group count. 395 void InferPedantic::compute(VecOrSet DiagsInPedantic, function in class:InferPedantic 512 inferPedantic.compute(&DiagsInPedantic, (RecordVec*)nullptr); 843 inferPedantic.compute(&DiagsInPedantic, &GroupsInPedantic);
|
/external/eigen/bench/ |
H A D | eig33.cpp | 110 // compute the eigen vectors 182 BENCH(t, tries, rep, eig.compute(A));
|
/external/eigen/test/ |
H A D | qr.cpp | 83 qr.compute(m1);
|
H A D | qr_colpivoting.cpp | 101 qr.compute(m1);
|
H A D | qr_fullpivoting.cpp | 85 qr.compute(m1);
|
/external/eigen/unsupported/test/ |
H A D | polynomialsolver.cpp | 41 psolve.compute( pols );
|
/external/javassist/src/main/javassist/bytecode/stackmap/ |
H A D | TypedBlock.java | 54 new Liveness().compute(ca.iterator(), blocks, ca.getMaxLocals(),
|
H A D | 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/libvpx/libvpx/vp8/common/ppc/ |
H A D | variance_altivec.asm | 64 ;# Now compute sse. 214 ;# Now compute sse.
|
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | BoundsChecking.cpp | 133 SizeOffsetEvalType SizeOffset = ObjSizeEval->compute(Ptr);
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/arm/neon/ |
H A D | vp9_reconintra_neon.asm | 310 ; Load left row by row and compute left + (above - ytop_left) 362 ; Load left row by row and compute left + (above - ytop_left) 436 ; Load left row by row and compute left + (above - ytop_left) 533 ; Load left row by row and compute left + (above - ytop_left)
|
/external/eigen/Eigen/src/SparseQR/ |
H A D | SparseQR.h | 85 * \sa compute() 89 compute(mat); 98 void compute(const MatrixType& mat) function in class:Eigen::SparseQR 124 eigen_assert(m_isInitialized && "The factorization should be called first, use compute()"); 167 eigen_assert(m_isInitialized && "The factorization should be called first, use compute()"); 204 * \sa compute() 209 eigen_assert(m_isInitialized && "The factorization should be called first, use compute()"); 216 eigen_assert(m_isInitialized && "The factorization should be called first, use compute()"); 331 ScalarVector tval(m); // The dense vector used to compute the current column 361 // Left looking rank-revealing QR factorization: compute [all...] |
/external/libvorbis/doc/ |
H A D | 09-helper.tex | 69 compute the correct length of the value index for a codebook VQ lookup
|
/external/libvpx/libvpx/vp9/common/arm/neon/ |
H A D | vp9_reconintra_neon.asm | 310 ; Load left row by row and compute left + (above - ytop_left) 362 ; Load left row by row and compute left + (above - ytop_left) 436 ; Load left row by row and compute left + (above - ytop_left) 533 ; Load left row by row and compute left + (above - ytop_left)
|
/external/eigen/Eigen/src/Eigen2Support/ |
H A D | SVD.h | 58 compute(matrix); 68 void compute(const MatrixType& matrix); 94 void SVD<MatrixType>::compute(const MatrixType& matrix) function in class:Eigen::SVD
|
/external/eigen/Eigen/src/Eigenvalues/ |
H A D | RealQZ.h | 38 * Call the function compute() to compute the real QZ decomposition of a 80 * perform decompositions via compute(). The \p size parameter is only 84 * \sa compute() for an example. 102 * This constructor calls compute() to compute the QZ decomposition. 112 compute(A, B, computeQZ); 160 RealQZ& compute(const MatrixType& A, const MatrixType& B, bool computeQZ = true); 557 RealQZ<MatrixType>& RealQZ<MatrixType>::compute(const MatrixType& A_in, const MatrixType& B_in, bool computeQZ) function in class:Eigen::RealQZ 574 // compute L [all...] |