| /external/skia/src/core/ |
| SkAntiRun.h | 15 /** Sparse array of run-length-encoded alpha (supersampling coverage) values.
|
| /external/webkit/Source/WebCore/rendering/ |
| RenderArena.h | 60 // The recycler array is sparse with the indices being multiples of 4,
|
| /system/core/toolbox/ |
| dd.c | 111 static off_t pending = 0; /* pending seek if sparse */
419 /* If there are pending sparse blocks, make sure
420 * to write out the final block un-sparse
478 int sparse, i; local
479 sparse = 1; /* Is buffer sparse? */
482 sparse = 0;
485 if (sparse) {
497 "sparse file: %s\n",
520 st.sparse += pending/out.dbsz
[all...] |
| /cts/tools/dasm/src/dasm/ |
| ReservedWords.java | 84 reserved_words.put("sparse-switch", new token(sym.SPARSE_SWITCH));
85 reserved_words.put("sparse-switch-end",
|
| /dalvik/tests/015-switch/src/ |
| Main.java | 79 case -10: System.out.print("CORRECT big sparse / first\n"); break;
101 case 100: System.out.print("CORRECT big sparse / last\n"); break;
|
| /external/e2fsprogs/lib/ext2fs/ |
| res_gdt.c | 22 * calling this for the first time. In a sparse filesystem it will be the
24 * For a non-sparse filesystem it will be every group: 1, 2, 3, 4, ...
|
| /external/e2fsprogs/util/ |
| copy_sparse.c | 2 * copy_sparse.c -- copy a very large sparse files efficiently
99 printf("Copying sparse file from %s to %s\n", src, dest);
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseSparseProductWithPruning.h | 18 // perform a pseudo in-place sparse * sparse product assuming all matrices are col major
|
| SparseUtil.h | 96 template<typename T> struct eval<T,Sparse>
127 template<typename T> struct plain_matrix_type<T,Sparse>
|
| SparseDenseProduct.h | 40 typedef Sparse StorageKind;
257 // dense = dense * sparse
289 // sparse * dense
|
| TriangularSolver.h | 110 if (tmp!=Scalar(0)) // optimization when other is actually sparse
142 if (tmp!=Scalar(0)) // optimization when other is actually sparse
193 // pure sparse path
|
| /external/eigen/test/eigen2/ |
| sparse.h | 28 #include <Eigen/Sparse>
37 /* Initializes both a sparse and dense matrix with same random values,
|
| /external/eigen/test/ |
| sparse.h | 40 #include <Eigen/Sparse>
49 /* Initializes both a sparse and dense matrix with same random values,
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| RegularImmutableTableTest.java | 41 private static final SparseImmutableTable<Character, Integer, String> SPARSE =
51 return ImmutableList.<ImmutableTable<Character, Integer, String>>of(SPARSE,
|
| /external/openfst/src/include/ |
| Makefile.am | 69 fst/sparse-tuple-weight.h fst/sparse-power-weight.h fst/expectation-weight.h \
|
| /external/openfst/src/include/fst/ |
| fstlib.h | 110 #include <fst/sparse-power-weight.h>
111 #include <fst/sparse-tuple-weight.h>
|
| /external/valgrind/main/coregrind/ |
| pub_core_sparsewa.h | 3 /*--- An sparse array (of words) implementation. ---*/
36 // PURPOSE: Provides an implementation of a sparse array of host words
|
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
| sparse_weight_vector.h | 17 // Purpose: A container for sparse weight vectors
18 // Maintains the sparse vector as a list of (name, value) pairs alongwith
|
| /system/core/fastboot/ |
| protocol.c | 39 #include <sparse/sparse.h>
|
| fastboot.c | 48 #include <sparse/sparse.h>
308 " -S <size>[K|M|G] automatically sparse files greater than\n"
513 die("cannot sparse read file '%s'\n", fname);
523 die("Failed to allocate sparse file array\n");
600 die("cannot sparse load '%s'\n", fname);
882 die("invalid sparse limit");
|
| /system/extras/ext4_utils/ |
| ext4_utils.h | 169 void write_ext4_image(int fd, int gz, int sparse, int crc);
189 int sparse, int crc, int wipe,
|
| extent.c | 22 #include <sparse/sparse.h>
|
| /external/eigen/Eigen/src/SuperLUSupport/ |
| SuperLUSupport.h | 85 * A wrapper class for SuperLU matrices. It supports only compressed sparse matrices
332 /** Computes the sparse Cholesky decomposition of \a matrix */
468 * \brief A sparse direct LU factorization and solver based on the SuperLU library
470 * This class allows to solve for A.X = B sparse linear problems via a direct LU factorization
471 * using the SuperLU library. The sparse matrix A must be squared and invertible. The vectors or matrices
472 * X and B can be either dense or sparse.
474 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
807 * \brief A sparse direct \b incomplete LU factorization and solver based on the SuperLU library
809 * This class allows to solve for an approximate solution of A.X = B sparse linear problems via an incomplete LU factorization
814 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<
[all...] |
| /external/ceres-solver/include/ceres/ |
| types.h | 72 // Solve the normal equations using a sparse cholesky solver; requires
83 // Solves the reduced linear system using a sparse Cholesky solver;
120 // High performance sparse Cholesky factorization and approximate
|
| /external/v8/test/mjsunit/ |
| array-indexing.js | 30 // Sparse arrays with length 42000.
79 // Find in sparse array.
146 // Find in sparse array.
|
