| /system/core/libsparse/ |
| Android.mk | 8 sparse.c \
|
| /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",
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| SparseFieldMatrix.java | 24 * Sparse matrix implementation based on an open addressed map.
35 /** Storage for (sparse) matrix elements. */
|
| /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 | 97 template<typename T> struct eval<T,Sparse>
129 template<typename T> struct plain_matrix_type<T,Sparse>
|
| /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/opencv3/samples/tapi/ |
| pyrlk_optical_flow.cpp | 183 imshow("PyrLK [Sparse]", frameCopy);
223 imshow("PyrLK [Sparse]", frame0);
|
| /external/squashfs-tools/squashfs-tools/ |
| unsquashfs.h | 100 char sparse; member in struct:inode
208 char sparse; member in struct:squashfs_file
|
| /external/valgrind/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
|
| /prebuilts/go/darwin-x86/src/regexp/ |
| onepass.go | 89 // Sparse Array implementation is used as a queueOnePass.
91 sparse []uint32
116 if u >= uint32(len(q.sparse)) {
119 return q.sparse[u] < q.size && q.dense[q.sparse[u]] == u
129 if u >= uint32(len(q.sparse)) {
132 q.sparse[u] = q.size
139 sparse: make([]uint32, size),
|
| /prebuilts/go/linux-x86/src/regexp/ |
| onepass.go | 89 // Sparse Array implementation is used as a queueOnePass.
91 sparse []uint32
116 if u >= uint32(len(q.sparse)) {
119 return q.sparse[u] < q.size && q.dense[q.sparse[u]] == u
129 if u >= uint32(len(q.sparse)) {
132 q.sparse[u] = q.size
139 sparse: make([]uint32, size),
|
| /system/core/fastboot/ |
| protocol.cpp | 39 #include <sparse/sparse.h>
|