/external/eigen/Eigen/src/SparseLU/ |
SparseLU.h | 49 * // Compute the ordering permutation vector from the structural pattern of A 51 * // Compute the numerical factorization 96 compute(matrix); 109 * Compute the symbolic and numeric factorization of the input sparse matrix. 112 void compute (const MatrixType& matrix) function in class:Eigen::SparseLU 175 * \sa compute() 188 * \sa compute() 361 * Compute the column permutation to minimize the fill-in 365 * - Compute the column elimination tree on the permuted matrix 374 //TODO It is possible as in SuperLU to compute row and columns scaling vectors to equilibrate the matrix mat [all...] |
/external/eigen/Eigen/src/SparseQR/ |
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()"); 172 // Compute Q^T * b; 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()"); 284 // Compute the column fill reducing orderin [all...] |
/external/libvorbis/doc/ |
09-helper.tex | 69 compute the correct length of the value index for a codebook VQ lookup
|
07-floor1.tex | 56 -45, 0, -25, -10, 30 and -10. We compute the floor in the following 355 Then compute the final curve in one pass:
|
/external/libvpx/libvpx/vp9/common/arm/neon/ |
vp9_reconintra_neon.asm | 307 ; Compute above - ytop_left 310 ; Load left row by row and compute left + (above - ytop_left) 359 ; Compute above - ytop_left 362 ; Load left row by row and compute left + (above - ytop_left) 430 ; Compute above - ytop_left 436 ; Load left row by row and compute left + (above - ytop_left) 525 ; Compute above - ytop_left 533 ; Load left row by row and compute left + (above - ytop_left)
|
/hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/arm/neon/ |
vp9_reconintra_neon.asm | 307 ; Compute above - ytop_left 310 ; Load left row by row and compute left + (above - ytop_left) 359 ; Compute above - ytop_left 362 ; Load left row by row and compute left + (above - ytop_left) 430 ; Compute above - ytop_left 436 ; Load left row by row and compute left + (above - ytop_left) 525 ; Compute above - ytop_left 533 ; Load left row by row and compute left + (above - ytop_left)
|
/libcore/jsr166-tests/src/test/java/jsr166/ |
JSR166TestCase.java | [all...] |
RecursiveTaskTest.java | 195 return (new FibTask(n - 2)).compute() + f1.join(); 208 public Integer compute() { method in class:RecursiveTaskTest.FailingFibTask 214 return (new FibTask(n - 2)).compute() + f1.join(); [all...] |
/external/chromium_org/third_party/skia/tools/skpdiff/ |
diff_viewer.js | 46 // compute the scaled image width/height for image and canvas 135 // compute a rect (x,y,width,height) that represents the bounding box for
|
/external/chromium_org/ui/file_manager/file_manager/foreground/js/ |
file_selection.js | 30 // Synchronously compute what we can. 129 // Don't compute the directory size as it's expensive.
|
/external/eigen/Eigen/src/Eigenvalues/ |
Tridiagonalization.h | 46 * decomposition. This class is used in SelfAdjointEigenSolver to compute the 49 * Call the function compute() to compute the tridiagonal decomposition of a 107 * perform decompositions via compute(). The \p size parameter is only 111 * \sa compute() for an example. 124 * This constructor calls compute() to compute the tridiagonal decomposition. 155 Tridiagonalization& compute(const MatrixType& matrix) function in class:Eigen::Tridiagonalization 169 * the member function compute(const MatrixType&) has been called before 170 * to compute the tridiagonal decomposition of a matrix [all...] |
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); 446 // Compute the shifts: (x,y,z,0...) = (AB^-1 - l1 I) (AB^-1 - l2 I) e1 557 RealQZ<MatrixType>& RealQZ<MatrixType>::compute(const MatrixType& A_in, const MatrixType& B_in, bool computeQZ function in class:Eigen::RealQZ [all...] |
/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/skia/tools/skpdiff/ |
diff_viewer.js | 46 // compute the scaled image width/height for image and canvas 135 // compute a rect (x,y,width,height) that represents the bounding box for
|
/ndk/build/core/ |
definitions-utils.mk | 196 # Used internally to compute a quoted left-justified text string. 213 # Used internally to compute a justification margin.
|
/external/eigen/Eigen/src/Eigen2Support/ |
SVD.h | 58 compute(matrix); 68 void compute(const MatrixType& matrix); 94 void SVD<MatrixType>::compute(const MatrixType& matrix) function in class:Eigen::SVD 122 // Compute the transformation for the k-th column and 156 // Compute the k-th row transformation and place the
|
/external/eigen/Eigen/src/SuperLUSupport/ |
SuperLUSupport.h | 333 void compute(const MatrixType& matrix) function in class:Eigen::SuperLUBase 341 * \sa compute() 354 * \sa compute() 500 Base::compute(matrix); 642 eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or analyzePattern()/factorize()"); 692 eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for extracting factors, you must first call either compute() or analyzePattern()/factorize()"); 778 eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for computing the determinant, you must first call either compute() or analyzePattern()/factorize()"); 837 Base::compute(matrix); 953 eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or analyzePattern()/factorize()");
|
/external/chromium_org/chrome/browser/resources/pdf/ |
viewport.js | 80 * @param {number} zoom compute whether scrollbars are needed at this zoom 270 * Compute the zoom level for fit-to-page or fit-to-width. |pageDimensions| is 279 // First compute the zoom without scrollbars. 311 // Compute available window space. 442 // Compute the page dimensions minus the shadows. 452 // Compute the x-coordinate of the page within the document. 457 // Compute the space on the left of the document if the document fits
|
/external/chromium_org/third_party/webrtc/modules/video_coding/codecs/test_framework/ |
exportfig.m | 261 %compute and set gray colormap 268 %compute and set ColorSpec and CData properties
|
/external/eigen/bench/spbench/ |
spbenchsolver.h | 225 solver.compute(A); 234 statbuf << " <COMPUTE> " << timer.value() << "</COMPUTE>\n"; 235 std::cout<< "COMPUTE TIME : " << timer.value() <<std::endl; 260 // Compute the relative residual norm
|
/external/libvpx/libvpx/vp8/common/arm/neon/ |
buildintrapredictorsmby_neon.asm | 50 ; compute shift and jump 240 ; Compute yabove_row - ytop_left 333 ; compute shift and jump 523 ; Compute yabove_row - ytop_left
|
/hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/arm/neon/ |
buildintrapredictorsmby_neon.asm | 50 ; compute shift and jump 240 ; Compute yabove_row - ytop_left 333 ; compute shift and jump 523 ; Compute yabove_row - ytop_left
|
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
cursor_selection.js | 224 //with both having no children. Use a range to compute the endOffset.
|
editable_text_area_shadow.js | 12 * Creates a shadow element for an editable text area used to compute line
|
/external/chromium_org/third_party/webtreemap/src/ |
webtreemap.js | 100 // |space|, and a starting rectangle index |start|, compute an span of
|