HomeSort by relevance Sort by last modified time
    Searched full:sparse (Results 26 - 50 of 507) sorted by null

12 3 4 5 6 7 8 91011>>

  /system/core/libsparse/
simg2img.c 17 #include <sparse/sparse.h>
70 fprintf(stderr, "Failed to read sparse file\n");
img2simg.c 30 #include <sparse/sparse.h>
95 fprintf(stderr, "Failed to create sparse file\n");
108 fprintf(stderr, "Failed to write sparse file\n");
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/
ANTLRIntArray.m 41 @synthesize SPARSE;
62 SPARSE = NO;
76 SPARSE = NO;
140 if ( SPARSE==NO && anIndex > idx ) {
143 else if ( SPARSE == YES && anIndex >= BuffSize ) {
157 if ( SPARSE==NO && anIndex > idx ) {
160 } else if ( SPARSE==YES && anIndex >= BuffSize ) {
169 if ( SPARSE == NO && anIndex > idx ) {
172 else if ( SPARSE == YES && anIndex >= BuffSize ) {
  /external/chromium/net/disk_cache/
net_log_parameters.h 31 // NetLog parameters for non-sparse reading and writing to an Entry.
47 // NetLog parameters for when a non-sparse read or write completes.
62 // NetLog parameters for when a sparse operation is started.
73 // NetLog parameters for when a read or write for a sparse entry's child is
  /external/eigen/Eigen/
PardisoSupport 15 * This module brings support for the Intel(R) MKL PARDISO direct sparse solvers.
SparseCholesky 11 * This module currently provides two variants of the direct sparse Cholesky decomposition for selfadjoint (hermitian) matrices.
IterativeLinearSolvers 12 * This module currently provides iterative methods to solve problems of the form \c A \c x = \c b, where \c A is a squared matrix, usually very large and sparse.
22 * Such problems can also be solved using the direct sparse decomposition modules: SparseCholesky, CholmodSupport, UmfPackSupport, SuperLUSupport.
  /external/eigen/doc/
C09_TutorialSparse.dox 3 /** \page TutorialSparse Tutorial page 9 - Sparse Matrix
24 Manipulating and solving sparse problems involves various modules which are summarized below:
28 <tr><td>\link Sparse_Module SparseCore \endlink</td><td>\code#include <Eigen/SparseCore>\endcode</td><td>SparseMatrix and SparseVector classes, matrix assembly, basic sparse linear algebra (including sparse triangular solvers)</td></tr>
29 <tr><td>\link SparseCholesky_Module SparseCholesky \endlink</td><td>\code#include <Eigen/SparseCholesky>\endcode</td><td>Direct sparse LLT and LDLT Cholesky factorization to solve sparse self-adjoint positive definite problems</td></tr>
31 <tr><td></td><td>\code#include <Eigen/Sparse>\endcode</td><td>Includes all the above modules</td></tr>
34 \section TutorialSparseIntro Sparse matrix representation
36 In many applications (e.g., finite element methods) it is common to deal with very large matrices where only a few coefficients are different from zero. In such cases, memory consumption can be reduced and performance increased by using a specialized representation storing only the nonzero coefficients. Such a matrix is called a sparse matrix.
40 The class SparseMatrix is the main sparse matrix representation of Eigen's sparse module; it offers high performance and low memory usage
    [all...]
  /cts/tools/vm-tests-tf/src/dot/junit/opcodes/sparse_switch/d/
T_sparse_switch_1.d 30 sparse-switch v4
34 sparse-switch-end
T_sparse_switch_11.d 30 sparse-switch v4
34 sparse-switch-end
T_sparse_switch_12.d 29 sparse-switch v4
33 sparse-switch-end
T_sparse_switch_13.d 30 sparse-switch v4
34 sparse-switch-end
T_sparse_switch_14.d 31 sparse-switch v4
35 sparse-switch-end
T_sparse_switch_2.d 31 sparse-switch v4
35 sparse-switch-end
T_sparse_switch_3.d 31 sparse-switch v5
35 sparse-switch-end
T_sparse_switch_4.d 31 sparse-switch v3
35 sparse-switch-end
T_sparse_switch_5.d 31 sparse-switch v3
35 sparse-switch-end
T_sparse_switch_6.d 31 sparse-switch v3
35 sparse-switch-end
T_sparse_switch_7.d 30 sparse-switch v4
34 sparse-switch-end
T_sparse_switch_8.d 30 sparse-switch v4
34 sparse-switch-end
T_sparse_switch_9.d 30 sparse-switch v4
34 sparse-switch-end
  /dalvik/dx/tests/072-dex-switch-edge-cases/
expected.txt 56 0003: sparse-switch v2, 0010 // +000d
67 0010: sparse-switch-payload // for switch @ 0003
75 0003: sparse-switch v2, 0010 // +000d
86 0010: sparse-switch-payload // for switch @ 0003
94 0003: sparse-switch v2, 0010 // +000d
105 0010: sparse-switch-payload // for switch @ 0003
113 0003: sparse-switch v2, 0010 // +000d
124 0010: sparse-switch-payload // for switch @ 0003
  /dalvik/vm/mterp/armv5te/
OP_PACKED_SWITCH.S 4 * Handle a packed-switch or sparse-switch instruction. In both cases
13 * for: packed-switch, sparse-switch
  /dalvik/vm/mterp/mips/
OP_PACKED_SWITCH.S 4 * Handle a packed-switch or sparse-switch instruction. In both cases
13 * for: packed-switch, sparse-switch
  /external/eigen/doc/special_examples/
Tutorial_sparse_example.cpp 1 #include <Eigen/Sparse>
4 typedef Eigen::SparseMatrix<double> SpMat; // declares a column-major sparse matrix type of double

Completed in 1032 milliseconds

12 3 4 5 6 7 8 91011>>