| /external/chromium_org/v8/test/mjsunit/ |
| D | array-functions-prototype-misc.js | 179 var sparse = []; variable
180 sparse[pos + 1000] = 'is ';
181 sparse[pos + 271828] = 'time ';
182 sparse[pos + 31415] = 'the ';
183 sparse[pos + 012260199] = 'all ';
184 sparse[-1] = 'foo';
185 sparse[pos + 22591927] = 'good ';
186 sparse[pos + 1618033] = 'for ';
187 sparse[pos + 91] = ': Now ';
188 sparse[pos + 86720199] = 'men.';
[all …]
|
| /external/qemu/distrib/libsparse/include/sparse/ |
| D | sparse.h | 161 int sparse_file_write(struct sparse_file *s, int fd, bool gz, bool sparse,
176 int64_t sparse_file_len(struct sparse_file *s, bool sparse, bool crc);
196 int sparse_file_callback(struct sparse_file *s, bool sparse, bool crc,
215 int sparse_file_read(struct sparse_file *s, int fd, bool sparse, bool crc);
|
| /external/eigen/doc/ |
| D | TutorialSparse.dox | 7 Manipulating and solving sparse problems involves various modules which are summarized below:
11 …eMatrix and SparseVector classes, matrix assembly, basic sparse linear algebra (including sparse t…
12 … <Eigen/SparseCholesky>\endcode</td><td>Direct sparse LLT and LDLT Cholesky factorization to solve…
14 <td>%Sparse LU factorization to solve general square sparse systems</td></tr>
15 …de<Eigen/SparseQR>\endcode </td><td>%Sparse QR factorization for solving sparse linear least-squar…
22 …ized representation storing only the nonzero coefficients. Such a matrix is called a sparse matrix.
26 The class SparseMatrix is the main sparse matrix representation of Eigen's sparse module; it offers…
45 and one of its possible sparse, \b column \b major representation:
68 The results of %Eigen's operations always produces \b compressed sparse matrices.
97 In this example, we start by defining a column-major sparse matrix type of double \c SparseMatrix<d…
[all …]
|
| D | SparseQuickReference.dox | 2 /** \eigenManualPage SparseQuickRefPage Quick reference guide for sparse matrices
7 …sparse matrices in the class SparseMatrix. First, it is recommended to read the introductory tuto…
8 …column major. The default is column major. Most arithmetic operations on sparse matrices will asse…
96 sm1.isVector(); // Check if sm1 is a sparse vector or a sparse matrix
104 …sparse matrices provided that the dimensions are adequate and that the matrices have the same stor…
234 <td> For general sparse solve, Use any suitable module described at \ref TopicSparseSystems </td>
|
| /external/chromium_org/content/browser/resources/media/ |
| D | cache_entry.js | 17 this.sparse = false;
79 this.sparse = true;
92 this.sparse = true;
103 this.sparse = this.sparse || other.sparse;
|
| D | main.js | 87 cacheEntries[id].sparse = true;
93 cacheEntries[id].sparse = true;
|
| /external/qemu/distrib/ext4_utils/src/ |
| D | make_ext4fs_main.c | 68 int sparse = 0; in main() local
128 sparse = 1; in main()
164 if (wipe && sparse) { in main()
204 sparse, crc, wipe, sehnd, verbose); in main()
|
| D | ext2simg.c | 184 int sparse = 1; in main() local
200 sparse = 0; in main()
250 write_ext4_image(outfd, gzip, sparse, crc); in main()
|
| D | ext4_utils.h | 134 void write_ext4_image(int fd, int gz, int sparse, int crc);
156 int sparse, int crc, int wipe,
|
| /external/qemu/distrib/libsparse/src/ |
| D | sparse.c | 152 int sparse_file_write(struct sparse_file *s, int fd, bool gz, bool sparse, in sparse_file_write() argument
160 out = output_file_open_fd(fd, s->block_size, s->len, gz, sparse, chunks, crc); in sparse_file_write()
172 int sparse_file_callback(struct sparse_file *s, bool sparse, bool crc, in sparse_file_callback() argument
181 sparse, chunks, crc); in sparse_file_callback()
200 int64_t sparse_file_len(struct sparse_file *s, bool sparse, bool crc) in sparse_file_len() argument
208 s->block_size, s->len, false, sparse, chunks, crc); in sparse_file_len()
|
| D | output_file.h | 25 int gz, int sparse, int chunks, int crc);
27 void *priv, unsigned int block_size, int64_t len, int gz, int sparse,
|
| D | output_file.c | 542 int64_t len, bool sparse, int chunks, bool crc) in output_file_init() argument
566 if (sparse) { in output_file_init()
572 if (sparse) { in output_file_init()
632 int gz __unused, int sparse, int chunks, int crc) in output_file_open_callback() argument
647 ret = output_file_init(&outc->out, block_size, len, sparse, chunks, crc); in output_file_open_callback()
657 int gz, int sparse, int chunks, int crc) in output_file_open_fd() argument
673 ret = output_file_init(out, block_size, len, sparse, chunks, crc); in output_file_open_fd()
|
| D | sparse_read.c | 406 int sparse_file_read(struct sparse_file *s, int fd, bool sparse, bool crc) in sparse_file_read() argument
408 if (crc && !sparse) { in sparse_file_read()
412 if (sparse) { in sparse_file_read()
|
| /external/eigen/Eigen/ |
| D | OrderingMethods | 13 * It defines various built-in and external ordering methods for sparse matrices.
15 * the sparse matrix decomposition (LLT, LU, QR).
18 * Using for instance the sparse Cholesky decomposition, it is expected that
27 * A simple usage is as a template parameter in the sparse decomposition classes :
|
| D | IterativeLinearSolvers | 12 …oblems 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, …
|
| D | SparseCore | 17 * This module provides a sparse matrix representation, and basic associatd matrix manipulations
31 /** The type used to identify a general sparse storage. */
|
| D | PardisoSupport | 15 * This module brings support for the Intel(R) MKL PARDISO direct sparse solvers.
|
| /external/smali/smali/src/test/resources/LexerTest/ |
| D | DirectiveTest.tokens | 20 SPARSE_SWITCH_DIRECTIVE(".sparse-switch")
21 END_SPARSE_SWITCH_DIRECTIVE(".end sparse-switch")
|
| /external/ceres-solver/docs/source/ |
| D | features.rst | 51 `Eigen`_ or `LAPACK`_) for dense problems, sparse Cholesky
52 factorization (`SuiteSparse`_ or `CXSparse`_) for large sparse
53 problems custom Schur complement based dense, sparse, and
87 .. _SuiteSparse: http://www.cise.ufl.edu/research/sparse/SuiteSparse/
90 .. _CXSparse: https://www.cise.ufl.edu/research/sparse/CXSparse/
|
| /external/e2fsprogs/tests/f_big_sparse/ |
| D | name | 1 big sparse file
|
| /external/e2fsprogs/misc/ |
| D | e2image.c | 561 int sparse = 0; in output_meta_data_blocks() local
662 if (sparse) in output_meta_data_blocks()
663 seek_relative(fd, sparse); in output_meta_data_blocks()
664 sparse = 0; in output_meta_data_blocks()
678 sparse += fs->blocksize; in output_meta_data_blocks()
679 if (sparse > 1024*1024) { in output_meta_data_blocks()
681 sparse -= 1024*1024; in output_meta_data_blocks()
698 sparse = 0; in output_meta_data_blocks()
715 if (sparse) { in output_meta_data_blocks()
721 offset = seek_relative(fd, sparse); in output_meta_data_blocks()
[all …]
|
| /external/llvm/test/YAMLParser/ |
| D | construct-null.data | 15 sparse:
|
| /external/ceres-solver/scripts/ |
| D | ceres-solver.spec | 45 - Sparse Cholesky factorization (using SuiteSparse) for large sparse problems
47 - Iterative linear solvers for general sparse and bundle adjustment problems
|
| /external/eigen/unsupported/Eigen/ |
| D | ArpackSupport | 18 * This module provides a wrapper to Arpack, a library for sparse eigenvalue decomposition.
|
| /external/opencv/ml/src/ |
| D | ml_inner_functions.cpp | 1260 const CvSparseMat* sparse = (const CvSparseMat*)sample; in cvPreparePredictData() local
1263 node = cvInitSparseMatIterator( sparse, &mat_iterator ); in cvPreparePredictData()
1280 int idx = *CV_NODE_IDX( sparse, node ); in cvPreparePredictData()
1287 row_sample[idx] = *(float*)CV_NODE_VAL( sparse, node ); in cvPreparePredictData()
1296 int idx = *CV_NODE_IDX( sparse, node ); in cvPreparePredictData()
1304 ptr->val = *(float*)CV_NODE_VAL( sparse, node ); in cvPreparePredictData()
1628 CvSparseMat* sparse = (CvSparseMat*)predict_input;
1660 node = cvInitSparseMatIterator( sparse, &mat_iterator );
1663 int* idx = CV_NODE_IDX( sparse, node );
1671 *(float*)cvPtrND( sparse, &idx1, 0, 1, 0 ) = *(float*)CV_NODE_VAL( sparse, node );
|