/external/e2fsprogs/tests/f_big_sparse/ |
name | 1 big sparse file
|
/external/eigen/Eigen/ |
Eigen | 2 //#include "Sparse"
|
Sparse | 4 /** \defgroup Sparse_modules Sparse modules 13 * #include <Eigen/Sparse>
|
SparseCore | 17 * This module provides a sparse matrix representation, and basic associatd matrix manipulations 20 * See the \ref TutorialSparse "Sparse tutorial" 31 /** The type used to identify a general sparse storage. */ 32 struct Sparse {};
|
/dalvik/tests/015-switch/ |
expected.txt | 9 CORRECT big sparse / first 10 CORRECT big sparse / last
|
/system/core/libsparse/include/sparse/ |
sparse.h | 26 * sparse_file_new - create a new sparse file cookie 29 * @len - size of the expanded sparse file. 36 * Returns the sparse file cookie, or NULL on error. 41 * sparse_file_destroy - destroy a sparse file cookie 43 * @s - sparse file cookie 45 * Destroys a sparse file cookie. After destroy, all memory passed in to 51 * sparse_file_add_data - associate a data chunk with a sparse file 53 * @s - sparse file cookie 56 * @block - offset in blocks into the sparse file to place the data chunk 58 * Associates a data chunk with a sparse file cookie. The regio [all...] |
/external/eigen/Eigen/src/SparseCore/ |
SparseTranspose.h | 15 template<typename MatrixType> class TransposeImpl<MatrixType,Sparse> 29 // NOTE: VC10 trigger an ICE if don't put typename TransposeImpl<MatrixType,Sparse>:: in front of Index, 30 // a typedef typename TransposeImpl<MatrixType,Sparse>::Index Index; 33 template<typename MatrixType> class TransposeImpl<MatrixType,Sparse>::InnerIterator 39 EIGEN_STRONG_INLINE InnerIterator(const TransposeImpl& trans, typename TransposeImpl<MatrixType,Sparse>::Index outer) 42 inline typename TransposeImpl<MatrixType,Sparse>::Index row() const { return Base::col(); } 43 inline typename TransposeImpl<MatrixType,Sparse>::Index col() const { return Base::row(); } 46 template<typename MatrixType> class TransposeImpl<MatrixType,Sparse>::ReverseInnerIterator 52 EIGEN_STRONG_INLINE ReverseInnerIterator(const TransposeImpl& xpr, typename TransposeImpl<MatrixType,Sparse>::Index outer) 55 inline typename TransposeImpl<MatrixType,Sparse>::Index row() const { return Base::col(); [all...] |
SparseCwiseBinaryOp.h | 16 // 1 - sparse op dense 17 // 2 - dense op sparse 18 // 3 - sparse op sparse 23 // 1 - sparse op dense product sparse 25 // 2 - dense op sparse product sparse 27 // 3 - sparse op sparse product spars [all...] |
SparseCwiseUnaryOp.h | 16 class CwiseUnaryOpImpl<UnaryOp,MatrixType,Sparse> 34 class CwiseUnaryOpImpl<UnaryOp,MatrixType,Sparse>::InnerIterator 35 : public CwiseUnaryOpImpl<UnaryOp,MatrixType,Sparse>::MatrixTypeIterator 38 typedef typename CwiseUnaryOpImpl<UnaryOp,MatrixType,Sparse>::MatrixTypeIterator Base; 57 class CwiseUnaryOpImpl<UnaryOp,MatrixType,Sparse>::ReverseInnerIterator 58 : public CwiseUnaryOpImpl<UnaryOp,MatrixType,Sparse>::MatrixTypeReverseIterator 61 typedef typename CwiseUnaryOpImpl<UnaryOp,MatrixType,Sparse>::MatrixTypeReverseIterator Base; 80 class CwiseUnaryViewImpl<ViewOp,MatrixType,Sparse> 98 class CwiseUnaryViewImpl<ViewOp,MatrixType,Sparse>::InnerIterator 99 : public CwiseUnaryViewImpl<ViewOp,MatrixType,Sparse>::MatrixTypeIterato [all...] |
/dalvik/vm/mterp/c/ |
OP_SPARSE_SWITCH.cpp | 9 ILOGV("|sparse-switch v%d +0x%04x", vsrc1, offset); 17 dvmThrowInternalError("bad sparse switch");
|
/system/core/libsparse/ |
output_file.h | 20 #include <sparse/sparse.h> 25 int gz, int sparse, int chunks, int crc); 27 void *priv, unsigned int block_size, int64_t len, int gz, int sparse,
|
simg2simg.c | 31 #include <sparse/sparse.h> 39 fprintf(stderr, "Usage: simg2simg <sparse image file> <sparse_image_file> <max_size>\n"); 69 fprintf(stderr, "Failed to import sparse file\n"); 81 fprintf(stderr, "Failed to allocate sparse file array\n"); 106 fprintf(stderr, "Failed to write sparse file\n");
|
sparse_err.c | 17 #include <sparse/sparse.h>
|
sparse_file.h | 20 #include <sparse/sparse.h>
|
sparse.c | 20 #include <sparse/sparse.h> 151 int sparse_file_write(struct sparse_file *s, int fd, bool gz, bool sparse, 159 out = output_file_open_fd(fd, s->block_size, s->len, gz, sparse, chunks, crc); 171 int sparse_file_callback(struct sparse_file *s, bool sparse, bool crc, 180 sparse, chunks, crc); 199 int64_t sparse_file_len(struct sparse_file *s, bool sparse, bool crc) 207 s->block_size, s->len, false, sparse, chunks, crc); 234 * overhead is sparse file header, initial skip chunk, split chunk, end 255 * requested size, split the chunk. Results in sparse files tha [all...] |
/dalvik/vm/mterp/x86/ |
OP_PACKED_SWITCH.S | 4 * Handle a packed-switch or sparse-switch instruction. In both cases 10 * for: packed-switch, sparse-switch
|
/external/eigen/unsupported/Eigen/ |
SparseExtra | 4 #include "../../Eigen/Sparse" 23 * This module contains some experimental features extending the sparse module.
|
/external/smali/smali/src/test/resources/LexerTest/ |
DirectiveTest.smali | 21 .sparse-switch 22 .end sparse-switch
|
/external/llvm/test/YAMLParser/ |
construct-null.data | 15 sparse:
|
/external/chromium/net/disk_cache/ |
sparse_control.h | 28 // This class provides support for the sparse capabilities of the disk cache. 29 // Basically, sparse IO is directed from EntryImpl to this class, and we split 32 // used directly for sparse operations (the entry passed in to the constructor). 47 // sparse data, or can be used to do it, it updates the relevant information 51 // Performs a quick test to see if the entry is sparse or not, without 55 // Performs an actual sparse read or write operation for this entry. |op| is 56 // the operation to perform, |offset| is the desired sparse offset, |buf| and 67 // Cancels the current sparse operation (if any). 79 // Creates a new sparse entry or opens an aready created entry from disk. 124 // Initializes the sparse info for the current child [all...] |
mem_entry_impl.h | 21 // types of entries, parent and child to support sparse caching. 23 // A parent entry is non-sparse until a sparse method is invoked (i.e. 24 // ReadSparseData, WriteSparseData, GetAvailableRange) when sparse information 26 // sparse API calls to the child entries. It creates and deletes child entries 29 // A child entry is used to carry partial cache content, non-sparse methods like 36 // A sparse entry has a fixed maximum size and can be partially filled. There 37 // can only be one continous filled region in a sparse entry, as illustrated by 44 // region. The book keeping for filled region in a sparse entry is done by using 142 // Initializes the children map and sparse info. This method is only calle [all...] |
/external/ceres-solver/internal/ceres/ |
sparse_matrix.h | 31 // Interface definition for sparse matrices. 47 // sparse matrices. The key property that differentiates different 48 // sparse matrices is how they are organized in memory and how the 54 // sparse matrix will have a two part representation. A values array 55 // that will be used to store the entries of the sparse matrix and 63 // the structure of the sparse matrix as that seems to be highly 65 // with an efficient high level interface that spans multiple sparse 86 // sparse matrix. 90 // Dump the sparse matrix to a proto. Destroys the contents of proto. 96 // sparse matrix [all...] |
/external/eigen/Eigen/src/CholmodSupport/ |
CholmodSupport.h | 48 /** Wraps the Eigen sparse matrix \a mat into a Cholmod sparse matrix object. 100 /** Returns a view of the Eigen sparse matrix \a mat as Cholmod sparse matrix. 134 /** Returns a view of the Cholmod sparse matrix \a cm as an Eigen sparse matrix. 204 /** Computes the sparse Cholesky decomposition of \a matrix */ 311 // note: cs stands for Cholmod Sparse 341 * This class allows to solve for A.X = B sparse linear problems via a simplicial LL^T Cholesky factorization 344 * The sparse matrix A must be selfajoint and positive definite. The vectors or matrice [all...] |
/external/e2fsprogs/contrib/ |
make-sparse.c | 2 * make-sparse.c --- make a sparse file from stdin 55 fprintf(stderr, "Usage: make-sparse out-file\n");
|
/external/e2fsprogs/lib/ext2fs/ |
sparse.c | 2 * sparse.c --- find the groups in an ext2 filesystem with metadata backups 47 * calling this for the first time. In a sparse filesystem it will be the 49 * For a non-sparse filesystem it will be every group: 1, 2, 3, 4, ...
|