| /external/eigen/Eigen/ |
| IterativeLinearSolvers | 12 * This module currently provides iterative methods to solve problems 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, CholmodSupport, UmfPackSupport, SuperLUSupport.
|
| SPQRSupport | 13 * This module provides an interface to the SPQR library, which is part of the <a href="http://www.cise.ufl.edu/research/sparse/SuiteSparse/">suitesparse</a> package.
|
| /external/eigen/doc/special_examples/ |
| Tutorial_sparse_example.cpp | 1 #include <Eigen/Sparse>
4 typedef Eigen::SparseMatrix<double> SpMat; // declares a column-major sparse matrix type of double
|
| Tutorial_sparse_example_details.cpp | 1 #include <Eigen/Sparse>
5 typedef Eigen::SparseMatrix<double> SpMat; // declares a column-major sparse matrix type of double
|
| /external/eigen/unsupported/Eigen/ |
| SparseExtra | 13 #include "../../Eigen/Sparse"
32 * This module contains some experimental features extending the sparse module.
|
| ArpackSupport | 18 * This module provides a wrapper to Arpack, a library for sparse eigenvalue decomposition.
|
| /external/mmc-utils/ |
| Makefile | 24 # make C=1 to enable sparse
26 check = sparse $(CHECKFLAGS)
|
| /external/smali/smali/src/test/resources/LexerTest/ |
| DirectiveTest.tokens | 20 SPARSE_SWITCH_DIRECTIVE(".sparse-switch")
21 END_SPARSE_SWITCH_DIRECTIVE(".end sparse-switch")
|
| /system/core/fastboot/ |
| fs.cpp | 15 #include <sparse/sparse.h>
|
| /system/core/libsparse/ |
| sparse.c | 20 #include <sparse/sparse.h>
161 int sparse_file_write(struct sparse_file *s, int fd, bool gz, bool sparse,
169 out = output_file_open_fd(fd, s->block_size, s->len, gz, sparse, chunks, crc);
181 int sparse_file_callback(struct sparse_file *s, bool sparse, bool crc,
190 sparse, chunks, crc);
209 int64_t sparse_file_len(struct sparse_file *s, bool sparse, bool crc)
217 s->block_size, s->len, false, sparse, chunks, crc);
246 * overhead is sparse file header, the potential end skip
276 * requested size, split the chunk. Results in sparse files tha
[all...] |
| /external/eigen/test/ |
| sparse_product.cpp | 10 #include "sparse.h"
87 // sparse * sparse
106 // sparse * dense
115 // dense * sparse
121 // sparse * dense and dense * sparse outer product
126 // sparse matrix * sparse vector
209 // sparse selfadjointView * sparse
[all...] |
| sparse_solver.h | 10 #include "sparse.h"
27 std::cerr << "sparse solver testing: factorization failed (check_sparse_solving)\n";
34 std::cerr << "sparse solver testing: solving failed\n";
37 VERIFY(oldb.isApprox(b) && "sparse solver testing: the rhs should not be modified!");
46 std::cerr << "sparse solver testing: factorization failed (check_sparse_solving)\n";
53 std::cerr << "sparse solver testing: solving failed\n";
56 VERIFY(oldb.isApprox(b) && "sparse solver testing: the rhs should not be modified!");
67 VERIFY(oldb.isApprox(db) && "sparse solver testing: the rhs should not be modified!");
84 std::cerr << "sparse solver testing: factorization failed (check_sparse_solving_real_cases)\n";
91 std::cerr << "sparse solver testing: solving failed\n"
[all...] |
| /external/llvm/include/llvm/ADT/ |
| SparseSet.h | 1 //===--- llvm/ADT/SparseSet.h - Sparse set ----------------------*- C++ -*-===//
11 // Briggs, Torczon, "An efficient representation for sparse sets", ACM Letters
14 // A sparse set holds a small number of objects identified by integer keys from
15 // a moderately sized universe. The sparse set uses more memory than other
97 /// SparseSet contains a dense vector holding all the objects and a sparse
99 /// the sparse array which is the size of the key universe. The SparseT
103 /// When SparseT is uint32_t, find() only touches 2 cache lines, but the sparse
107 /// lines, but the sparse array is 4x smaller. N is the number of elements in
129 SparseT *Sparse;
146 SparseSet() : Sparse(nullptr), Universe(0) {
[all...] |
| /system/update_engine/payload_generator/ |
| ext2_filesystem_unittest.cc | 145 "/sparse-10000blocks",
146 "/sparse-16k-last_block",
147 "/sparse-16k-first_block",
148 "/sparse-16k-holes",
173 EXPECT_EQ(1U, BlocksInExtents(map_files["/sparse-16k-last_block"].extents));
175 BlocksInExtents(map_files["/sparse-16k-first_block"].extents));
176 EXPECT_EQ(2U, BlocksInExtents(map_files["/sparse-16k-holes"].extents));
|
| /external/deqp/external/vulkancts/modules/vulkan/sparse_resources/ |
| vktSparseResourcesBufferSparseBinding.cpp | 21 * \brief Buffer Sparse Binding tests
50 namespace sparse namespace in namespace:vkt
109 return tcu::TestStatus(QP_TEST_RESULT_NOT_SUPPORTED, "Sparse binding not supported");
119 // Create logical device supporting both sparse and transfer queues
122 return tcu::TestStatus(QP_TEST_RESULT_FAIL, "Could not create device supporting sparse and compute queue");
130 // Create queue supporting sparse binding operations
157 // Create sparse buffer
164 return tcu::TestStatus(QP_TEST_RESULT_NOT_SUPPORTED, "Required memory size for sparse resources exceeds device limits");
234 // Submit sparse bind commands for execution
317 // Wait for sparse queue to become idl
[all...] |
| /external/smali/smali-integration-tests/src/test/smali/junit-tests/InstructionTests/Format31t/ |
| Format31t.smali | 101 sparse-switch v0, :SparseSwitch
123 .sparse-switch
129 .end sparse-switch
|
| /system/extras/f2fs_utils/ |
| f2fs_utils.c | 37 #include <sparse/sparse.h>
73 sparse_file_write(f2fs_sparse_file, fd, /*gzip*/0, /*sparse*/1, /*crc*/0);
|
| /external/bsdiff/ |
| extents.h | 17 // former indicates a sparse extent (consisting of zeros). A length is a
|
| /external/ceres-solver/internal/ceres/ |
| reorder_program.h | 67 // constrained fill-reducing ordering is available in the sparse
82 // Sparse cholesky factorization routines when doing the sparse
89 // fill-reducing ordering is available in the sparse linear algebra
|
| /external/eigen/test/eigen2/ |
| CMakeLists.txt | 50 # no support for eigen2 sparse module
|
| /external/v8/test/mjsunit/regress/ |
| regress-3643.js | 18 // Sparse case should hit the same code as above due to presence of the getter.
|
| /system/extras/squashfs_utils/ |
| mksquashfsimage.sh | 27 SPARSE=false
29 SPARSE=true
129 SPARSE_SUFFIX=".sparse"
130 if [ "$SPARSE" = true ]; then
|
| /system/update_engine/sample_images/ |
| generate_images.sh | 56 # sparse_empty: Files with no data blocks at all (only sparse holes).
60 # sparse: Files with some data blocks but also sparse holes.
62 sudo dd of="${mntdir}"/sparse-16k-last_block bs=1 \
69 sudo dd of="${mntdir}"/sparse-10000blocks bs=1 \
72 sudo truncate --size=16384 "${mntdir}"/sparse-16k-first_block
73 echo "first block" | sudo dd of="${mntdir}"/sparse-16k-first_block status=none
75 sudo truncate --size=16384 "${mntdir}"/sparse-16k-holes
76 echo "a" | sudo dd of="${mntdir}"/sparse-16k-holes bs=1 seek=100 status=none
77 echo "b" | sudo dd of="${mntdir}"/sparse-16k-holes bs=1 seek=10000 status=non
[all...] |
| /art/runtime/interpreter/mterp/mips/ |
| op_packed_switch.S | 3 * Handle a packed-switch or sparse-switch instruction. In both cases
9 * for: packed-switch, sparse-switch
|
| /external/autotest/client/tests/wb_kupdate/ |
| control | 8 This tests checks the wb_kupdate code path by writting data to a sparse file
27 sparse_file=os.path.join( # Absolute path to the sparse file.
|
