| /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>
|
| /system/core/toolbox/upstream-netbsd/bin/dd/ |
| dd.h | 100 uint64_t sparse; /* # of sparse output blocks */ member in struct:__anon74840
|
| /system/extras/ext4_utils/ |
| ext4_utils.h | 141 void write_ext4_image(int fd, int gz, int sparse, int crc);
163 int sparse, int crc, int wipe, int real_uuid,
|
| /external/opencv3/apps/traincascade/ |
| old_ml_inner_functions.cpp | 1186 const CvSparseMat* sparse = (const CvSparseMat*)sample; local
[all...] |
| /external/opencv3/modules/imgproc/test/ |
| test_histograms.cpp | 757 CvSparseMat* sparse = (CvSparseMat*)hist[0]->bins; local
761 for( node = cvInitSparseMatIterator( sparse, &iterator );
764 sum += *(float*)CV_NODE_VAL(sparse,node);
850 CvSparseMat* sparse = (CvSparseMat*)hist[0]->bins; local
855 orig_nz_count = sparse->heap->active_count;
860 for( node = cvInitSparseMatIterator( sparse, &iterator ), i = 0;
863 const int* idx = CV_NODE_IDX(sparse,node);
867 values->data.fl[i] = *(float*)CV_NODE_VAL(sparse,node);
893 CvSparseMat* sparse = 0;
898 sparse = (CvSparseMat*)hist[0]->bins
[all...] |
| /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<>
808 * \brief A sparse direct \b incomplete LU factorization and solver based on the SuperLU library
810 * This class allows to solve for an approximate solution of A.X = B sparse linear problems via an incomplete LU factorization
815 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<
[all...] |
| /build/tools/releasetools/ |
| sparse_img.py | 24 """Wraps a sparse image file into an image object.
26 Wraps a sparse image file (and optional file map and clobbered_blocks) into
140 # Update the sparse header
|
| /external/deqp/external/vulkancts/modules/vulkan/sparse_resources/ |
| vktSparseResourcesTestsUtil.hpp | 23 * \brief Sparse Resources Tests Utility Classes
37 namespace sparse namespace in namespace:vkt
228 } // sparse
|
| /external/e2fsprogs/misc/ |
| e2image.c | 561 int sparse = 0; local
662 if (sparse)
663 seek_relative(fd, sparse);
664 sparse = 0;
678 sparse += fs->blocksize;
679 if (sparse > 1024*1024) {
681 sparse -= 1024*1024;
698 sparse = 0;
715 if (sparse) {
721 offset = seek_relative(fd, sparse);
[all...] |
