| /external/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/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/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/eigen/doc/ |
| D | C09_TutorialSparse.dox | 24 Manipulating and solving sparse problems involves various modules which are summarized below:
28 …eMatrix and SparseVector classes, matrix assembly, basic sparse linear algebra (including sparse t…
29 … <Eigen/SparseCholesky>\endcode</td><td>Direct sparse LLT and LDLT Cholesky factorization to solve…
36 …ized 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…
59 and one of its possible sparse, \b column \b major representation:
82 The results of %Eigen's operations always produces \b compressed sparse matrices.
111 In this example, we start by defining a column-major sparse matrix type of double \c SparseMatrix<d…
140 … mat(1000,2000); // declares a 1000x2000 column-major compressed sparse matrix of complex<…
141 …> mat(1000,2000); // declares a 1000x2000 row-major compressed sparse matrix of double
[all …]
|
| D | SparseQuickReference.dox | 2 /** \page SparseQuickRefPage Quick reference guide for sparse matrices
17 …sparse matrices in the class SparseMatrix. First, it is recommended to read first the introductory…
18 …column major. The default is column major. Most arithmetic operations on sparse matrices will asse…
21 SparseMatrix is the core class to build and manipulate sparse matrices in Eigen. It takes as templa…
24 …SparseMatrix<double> sm1(1000,1000); // 1000x1000 compressed sparse matrix of double.
43 Insertions of values in the sparse matrix can be done directly by looping over nonzero elements and…
82 sm1.isVector(); // Check if sm1 is a sparse vector or a sparse matrix
89 It is easy to perform arithmetic operations on sparse matrices provided that the dimensions are ade…
169 …the columns of the sparse matrix for several purposes : fill-in reducing during matrix decompositi…
180 …ct a block of rows (resp. columns) from a row-major (resp. column major) sparse matrix. Note that …
|
| /external/e2fsprogs/misc/ |
| D | e2image.c | 411 int sparse = 0; in output_meta_data_blocks() local
437 write_block(fd, buf, sparse, fs->blocksize, blk); in output_meta_data_blocks()
438 sparse = 0; in output_meta_data_blocks()
446 sparse += fs->blocksize; in output_meta_data_blocks()
447 if (sparse >= 1024*1024) { in output_meta_data_blocks()
448 write_block(fd, 0, sparse, 0, 0); in output_meta_data_blocks()
449 sparse = 0; in output_meta_data_blocks()
453 if (sparse) in output_meta_data_blocks()
454 write_block(fd, zero_buf, sparse-1, 1, -1); in output_meta_data_blocks()
|
| /external/chromium_org/third_party/JSON/JSON-2.59/t/ |
| D | 03_types.t | 58 my @sparse; @sparse[0,3] = (1, 4);
59 ok ("[1,null,null,4]" eq encode_json \@sparse);
|
| /external/ceres-solver/docs/source/ |
| D | introduction.rst | 33 <http://www.cise.ufl.edu/research/sparse/SuiteSparse/>`_ and
34 `CXSparse <http://www.cise.ufl.edu/research/sparse/CSparse/>`_) for
35 large sparse problems.
40 d. Iterative linear solvers with preconditioners for general sparse
|
| D | building.rst | 40 <http://www.cise.ufl.edu/research/sparse/SuiteSparse/>`_ is used for
41 sparse matrix analysis, ordering and factorization. In particular
45 6. `CXSparse <http://www.cise.ufl.edu/research/sparse/CXSparse/>`_ is
46 a sparse matrix library similar in scope to ``SuiteSparse`` but with
186 brew install suite-sparse
314 mostly suitable for large scale optimization problems, or when sparse
|
| D | bibliography.rst | 56 preconditioner for large sparse least squares problems**, *SIAM
91 .. [Saad] Y. Saad, **Iterative methods for sparse linear
|
| /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/eigen/Eigen/ |
| 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 | SparseCholesky | 11 …* This module currently provides two variants of the direct sparse Cholesky decomposition for self…
|
| D | PardisoSupport | 15 * This module brings support for the Intel(R) MKL PARDISO direct sparse solvers.
|
| D | UmfPackSupport | 15 …k library which is part of the <a href="http://www.cise.ufl.edu/research/sparse/SuiteSparse/">suit…
|
| /external/e2fsprogs/tests/f_big_sparse/ |
| D | name | 1 big sparse file
|
| /external/llvm/test/YAMLParser/ |
| D | construct-null.data | 15 sparse:
|
| /external/ceres-solver/scripts/ |
| D | ceres-solver.spec | 44 - Sparse Cholesky factorization (using SuiteSparse) for large sparse problems
46 - Iterative linear solvers for general sparse and bundle adjustment problems
|
| /external/eigen/unsupported/Eigen/ |
| D | SparseExtra | 23 * This module contains some experimental features extending the sparse module.
|
| /external/e2fsprogs/util/ |
| D | Makefile.in | 44 copy-sparse
|
| /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 );
|
| /external/eigen/test/eigen2/ |
| D | CMakeLists.txt | 49 # no support for eigen2 sparse module
|
| /external/eigen/test/ |
| D | CMakeLists.txt | 21 set(EIGEN_TEST_MATRIX_DIR "" CACHE STRING "Enable testing of realword sparse matrices contained in …
24 message(STATUS "Test realworld sparse matrices: ${EIGEN_TEST_MATRIX_DIR}")
|