| /external/eigen/test/ |
| sparseqr.cpp | 9 #include "sparse.h"
60 std::cerr << "sparse QR factorization failed\n";
67 std::cerr << "sparse QR factorization failed\n";
|
| /external/smali/baksmali/src/main/java/org/jf/baksmali/Adaptors/Format/ |
| SparseSwitchMethodItem.java | 46 // Whether this sparse switch instruction should be commented out because it is never referenced
77 writer.write(".sparse-switch\n");
87 writer.write(".end sparse-switch");
|
| /external/v8/test/mjsunit/ |
| array-functions-prototype-misc.js | 179 var sparse = [];
180 sparse[pos + 1000] = 'is ';
181 sparse[pos + 271828] = 'time ';
182 sparse[pos + 31415] = 'the ';
183 sparse[pos + 012260199] = 'all ';
184 sparse[-1] = 'foo';
185 sparse[pos + 22591927] = 'good ';
186 sparse[pos + 1618033] = 'for ';
187 sparse[pos + 91] = ': Now ';
188 sparse[pos + 86720199] = 'men.'
[all...] |
| /system/core/libsparse/ |
| append2simg.c | 28 #include <sparse/sparse.h>
122 fprintf(stderr, "Failed to write sparse file\n");
|
| /system/update_engine/payload_generator/ |
| extent_ranges.h | 31 // ignores sparse hole extents mostly to avoid confusion between extending a
32 // sparse hole range vs. set addition but also to ensure that the delta
33 // generator doesn't use sparse holes as scratch space.
|
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| SwitchData.java | 28 * in either a "packed" or "sparse" form.
46 /** whether the output table will be packed (vs. sparse) */
183 sb.append(packed ? "packed" : "sparse");
219 * Gets the size of a sparse table for the given cases, in 16-bit code
223 * @return {@code > 0;} the sparse table size
250 * would be as small or smaller than 5/4 of the sparse
|
| /dalvik/dx/src/com/android/dx/dex/code/ |
| SwitchData.java | 29 * in either a "packed" or "sparse" form.
47 /** whether the output table will be packed (vs. sparse) */
184 sb.append(packed ? "packed" : "sparse");
220 * Gets the size of a sparse table for the given cases, in 16-bit code
224 * @return {@code > 0;} the sparse table size
251 * would be as small or smaller than 5/4 of the sparse
|
| /external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
| SwitchData.java | 29 * in either a "packed" or "sparse" form.
47 /** whether the output table will be packed (vs. sparse) */
184 sb.append(packed ? "packed" : "sparse");
220 * Gets the size of a sparse table for the given cases, in 16-bit code
224 * @return {@code > 0;} the sparse table size
251 * would be as small or smaller than 5/4 of the sparse
|
| /external/llvm/include/llvm/ADT/ |
| SparseMultiSet.h | 1 //===--- llvm/ADT/SparseMultiSet.h - Sparse multiset ------------*- C++ -*-===//
13 // A sparse multiset holds a small number of objects identified by integer keys
14 // from a moderately sized universe. The sparse multiset uses more memory than
47 /// SparseMultiSet contains a dense vector holding all the objects and a sparse
49 /// the sparse array which is the size of the key universe. The SparseT template
53 /// sparse array uses 4 x Universe bytes.
56 /// lines, but the sparse array is 4x smaller. N is the number of elements in
116 SparseT *Sparse;
191 : Sparse(nullptr), Universe(0), FreelistIdx(SMSNode::INVALID), NumFree(0) {}
193 ~SparseMultiSet() { free(Sparse); }
[all...] |
| /dalvik/dx/tests/045-dex-switch-ops/ |
| expected.txt | 33 0003: sparse-switch v2, 0016 // +0013
49 0016: sparse-switch-payload // for switch @ 0003
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRIntArray.h | 41 BOOL SPARSE;
72 @property (assign) BOOL SPARSE;
|
| /external/ceres-solver/internal/ceres/ |
| block_evaluate_preparer.h | 32 // directly into their final resting place in an overall block sparse matrix.
57 // Point the jacobian blocks directly into the block sparse matrix, if
|
| /external/e2fsprogs/misc/ |
| e2image.8.in | 96 creates the image file as a sparse file, or in QCOW2 format.
97 Hence, if the sparse image file
100 .B \-\-sparse=always
103 This does not apply to the QCOW2 image, which is not sparse.
142 created as a sparse file. (Beware of copying or
144 how to create sparse files; the file will become as large as the
179 the raw image it is not sparse. The QCOW2 image minimize the amount of disk
217 sparse image file where it can be loop mounted, or to a disk partition.
|
| /system/core/toolbox/upstream-netbsd/bin/dd/ |
| misc.c | 127 if (st.sparse) {
128 (void)snprintf(buf, sizeof(buf), "%llu sparse output %s\n",
129 (unsigned long long)st.sparse,
130 (st.sparse == 1) ? "block" : "blocks");
269 (unsigned long long)st.sparse);
284 if (st.sparse != 1) ADDS("s");
329 if (st.sparse) {
330 (void)dd_write_msg("%p sparse output %P\n", 1);
|
| /system/update_engine/payload_consumer/ |
| payload_constants.h | 68 // A block number denoting a hole on a sparse file. Used on Extents to refer to
69 // section of blocks not present on disk on a sparse file.
|
| /external/deqp/external/vulkancts/modules/vulkan/sparse_resources/ |
| vktSparseResourcesBufferSparseResidency.cpp | 21 * \brief Sparse partially resident buffers tests
50 namespace sparse namespace in namespace:vkt
148 return tcu::TestStatus(QP_TEST_RESULT_NOT_SUPPORTED, "Sparse partially resident buffers not supported");
158 // Create logical device supporting both sparse and compute oprations
161 return tcu::TestStatus(QP_TEST_RESULT_FAIL, "Could not create device supporting sparse and compute queue");
169 // Create queue supporting sparse binding operations
197 // Create sparse buffer
204 return tcu::TestStatus(QP_TEST_RESULT_NOT_SUPPORTED, "Required memory size for sparse resources exceeds device limits");
414 // Wait for sparse queue to become idle
429 de::MovePtr<tcu::TestCaseGroup> testGroup(new tcu::TestCaseGroup(testCtx, "buffer_sparse_residency", "Buffer Sparse Residency"))
[all...] |
| /external/eigen/Eigen/src/SparseQR/ |
| SparseQR.h | 40 * \brief Sparse left-looking rank-revealing QR factorization
43 * of sparse matrices. When a column has a norm less than a given tolerance
54 * R is the sparse triangular or trapezoidal matrix. The later occurs when A is rank-deficient.
57 * \tparam _MatrixType The type of the sparse matrix A, must be a column-major SparseMatrix<>
61 * \warning The input sparse matrix A must be in compressed mode (see SparseMatrix::makeCompressed()).
92 /** Computes the QR factorization of the sparse matrix \a mat.
114 /** \returns a const reference to the \b sparse upper triangular matrix R of the QR factorization.
128 /** \returns an expression of the matrix Q as products of sparse Householder reflectors.
141 * Internally, this call simply performs a sparse product between the matrix Q
142 * and a sparse identity matrix. However, due to the fact that the spars
[all...] |
| /device/linaro/hikey/wpan/uim/ |
| Makefile | 38 $(Q)$(MAKE) all CC="REAL_CC=$(CC) CHECK=\"sparse -Wall\" cgcc"
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| SparseRealMatrix.java | 21 * Marker interface for {@link RealMatrix} implementations that require sparse backing storage
|
| SparseRealVector.java | 20 * Marker interface for RealVectors that require sparse backing storage
|
| /external/ceres-solver/docs/source/ |
| bibliography.rst | 28 S. Rajamanickam, **Algorithm 887: CHOLMOD, Supernodal Sparse
62 preconditioner for large sparse least squares problems**, *SIAM
97 .. [Saad] Y. Saad, **Iterative methods for sparse linear
119 Levenberg Marquardt Method for Large Sparse Nonlinear Least
|
| /external/eigen/Eigen/ |
| CholmodSupport | 15 * This module provides an interface to the Cholmod library which is part of the <a href="http://www.cise.ufl.edu/research/sparse/SuiteSparse/">suitesparse</a> package.
|
| PaStiXSupport | 22 * PaSTiX is a general \b supernodal, \b parallel and \b opensource sparse solver.
|
| SparseCholesky | 21 * This module currently provides two variants of the direct sparse Cholesky decomposition for selfadjoint (hermitian) matrices.
|
| UmfPackSupport | 15 * This module provides an interface to the UmfPack library which is part of the <a href="http://www.cise.ufl.edu/research/sparse/SuiteSparse/">suitesparse</a> package.
|
