| /external/webkit/Source/JavaScriptCore/runtime/ |
| JSArray.cpp | 48 // * A sparse map of array entries.
57 // storage vector or the sparse map. An array index i will be handled in the following
62 // be stored in the storage vector or in the sparse array, depending on the density of
66 // in the sparse array.
89 // Our policy for when to use a vector and when to use a sparse map.
92 // as long as it is 1/8 full. If more sparse than that, we use a map.
408 // Fast case is when there is no sparse map, so we can increase the vector size without moving values from it.
586 // This function leaves the array in an internally inconsistent state, because it does not move any values from sparse value map
616 // This function leaves the array in an internally inconsistent state, because it does not move any values from sparse value map
779 // If m_length and m_numValuesInVector aren't the same, we have a sparse vecto
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| ConservativeSparseSparseProduct.h | 84 // if the result is sparse enough => use a quick sort
87 // result is clearly very sparse we use a linear bound up to 200.
|
| SparseVector.h | 18 * \brief a sparse vector class
34 typedef Sparse StorageKind;
|
| /external/neven/Embedded/common/src/b_TensorEm/ |
| CompactMat.h | 67 * (int16) 'offs' offset of row-vector (0 when row is not sparse)
68 * (int16) 'size' effective size of row vector (= widthE when row is not sparse)
|
| /external/ceres-solver/include/ceres/ |
| solver.h | 59 // Default constructor that sets up a generic sparse problem.
223 // Ceres supports using multiple sparse linear algebra libraries
224 // for sparse matrix ordering and factorizations. Currently,
236 // of the method. e.g., when doing sparse Cholesky factorization,
307 // doing sparse direct factorization of these matrices (for
575 // The Jacobian matrices are stored as compressed row sparse
|
| problem.h | 91 // of "sparse" least squares problems, where each component of the
98 // The canonical example of a sparse least squares problem is
|
| /external/opencv/ml/src/ |
| ml_inner_functions.cpp | 1260 const CvSparseMat* sparse = (const CvSparseMat*)sample; local
[all...] |
| /cts/tools/dasm/src/dasm/ |
| DAsm.java | 157 // packed-switch and sparse-switch data
165 * holds sparse-switch, packed-switch and fill-array-data data blocks to be
418 // add packed-switch, sparse-switch, fill-array-data data blocks at the
[all...] |
| /external/eigen/doc/ |
| I13_FunctionsTakingEigenTypes.dox | 22 \li MatrixBase: The common base class for all dense matrix expressions (as opposed to array expressions, as opposed to sparse and special matrix classes). Use it in functions that are meant to work only on dense matrices.
28 Prints the dimensions of the most generic object present in Eigen. It coulde be any matrix expressions, any dense or sparse matrix and any array.
38 Prints a sub-block of the dense expression. Accepts any dense matrix or array expression, but no sparse objects and no special matrix classes such as DiagonalMatrix.
|
| /external/smali/smali/src/test/resources/LexerTest/ |
| RealSmaliFileTest.tokens | 306 INSTRUCTION_FORMAT31t("sparse-switch")
349 SPARSE_SWITCH_DIRECTIVE(".sparse-switch")
362 END_SPARSE_SWITCH_DIRECTIVE(".end sparse-switch")
|
| /external/smali/smali-integration-tests/src/test/smali/junit-tests/AutofixTests/ |
| GotoTest.smali | 1196 sparse-switch v2, :SparseSwitch
1204 .sparse-switch
1208 .end sparse-switch
|
| /external/bison/lib/ |
| bbitset.h | 35 for large very sparse sets).
37 (variable size, less storage for large sparse sets).
|
| /external/ceres-solver/internal/ceres/ |
| visibility_based_preconditioner.h | 158 // sparse problems along with a CGLS solver.
236 // implemented using CHOLMOD's sparse triangular matrix solve
|
| /external/chromium/net/disk_cache/ |
| entry_impl.h | 224 // Initializes the sparse control object. Returns a net error code.
257 scoped_ptr<SparseControl> sparse_; // Support for sparse entries.
|
| /external/chromium/net/http/ |
| http_cache_transaction.h | 309 // Deletes the current partial cache entry (sparse), and optionally removes
351 bool is_sparse_; // The data is stored in sparse byte ranges.
|
| /external/eigen/test/eigen2/ |
| eigen2_sparse_basic.cpp | 10 #include "sparse.h"
229 // sparse cwise* dense
|
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| DynamicSparseMatrix.h | 19 * \brief A sparse matrix class designed for matrix assembly purpose
41 typedef Sparse StorageKind;
|
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
| sparse_weight_vector.cpp | 266 // First calculates the order-statistics of the sparse vector
304 // First calculates the order-statistics of the sparse vector
|
| /system/extras/ext4_utils/ |
| indirect.c | 23 #include <sparse/sparse.h>
|
| /build/tools/releasetools/ |
| build_image.py | 81 # Inflate the sparse image
|
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/sparse_switch/ |
| Test_sparse_switch.java | 202 * @title sparse-switch-data pseudo-instructions must not be reachable by control flow
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| package-info.java | 57 * <li> {@link SCCP} is a (partially implemented) sparse-conditional
|
| /dalvik/dx/src/com/android/dx/util/ |
| LabeledList.java | 26 * Sparse array indexed by label to FixedSizeList index;
|
| /development/ide/emacs/ |
| android-host.el | 46 (defvar android-host-command-map (make-sparse-keymap))
|
| /external/ceres-solver/docs/ |
| bundleadjustment.tex | 91 One way to solve this problem is to set \texttt{Solver::Options::linear\_solver\_type} to \texttt{SPARSE\_NORMAL\_CHOLESKY} and call \texttt{Solve}. And while this is a reasonable thing to do, bundle adjustment problems have a special sparsity structure that can be exploited to solve them much more efficiently. Ceres provides three specialized solvers (collectively known as Schur based solvers) for this task. The example code uses the simplest of them \texttt{DENSE\_SCHUR}.
|
