| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| SparseFieldVector.java | 134 * Optimized method to add sparse vectors.
402 * Optimized method to compute outer product when both vectors are sparse.
|
| /external/ceres-solver/cmake/ |
| FindSuiteSparse.cmake | 84 # == Sparse Supernodal Cholesky Factorization and Update/Downdate (CHOLMOD)
89 # == Multifrontal Sparse QR (SuiteSparseQR)
|
| /external/ceres-solver/include/ceres/ |
| problem.h | 93 // of "sparse" least squares problems, where each component of the
100 // The canonical example of a sparse least squares problem is
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| SCCP.java | 37 * A small variant of Wegman and Zadeck's Sparse Conditional Constant
88 * Performs sparse conditional constant propagation on a method.
|
| /external/eigen/test/ |
| sparse_basic.cpp | 12 #include "sparse.h"
307 // sparse cwise* dense
|
| /external/google-breakpad/src/third_party/libdisasm/ |
| ia32_insn.c | 404 /* Sparse table trick: check that byte is <= max value */
412 /* Sparse table trick: check that byte is >= min value */
|
| /external/llvm/include/llvm/ADT/ |
| SparseBitVector.h | 1 //===- llvm/ADT/SparseBitVector.h - Efficient Sparse BitVector -*- C++ -*- ===//
29 /// SparseBitVector is an implementation of a bitvector that is sparse by only
|
| /frameworks/base/core/java/com/android/internal/app/procstats/ |
| SparseMappingTable.java | 33 * a set of very sparse tables, that is mostly append or overwrite, with infrequent
148 // Store the key in the sparse lookup table for this Table object.
|
| /system/bt/embdrv/sbc/decoder/srce/ |
| synthesis-sbc.c | 34 and another, sparse matrix.
47 R turns out to be a sparse 16x8 matrix with the following non-zero
|
| /system/extras/ext4_utils/ |
| allocate.c | 20 #include <sparse/sparse.h>
|
| ext4fixup.c | 22 #include <sparse/sparse.h>
|
| /system/update_engine/scripts/ |
| brillo_update_payload | 397 # If the partition is stored as an Android sparse image file, we need to
403 echo "Converting Android sparse image ${part}.img to RAW."
|
| /device/google/contexthub/firmware/inc/platform/stm32f4xx/cmsis/ |
| arm_math.h | [all...] |
| /docs/source.android.com/src/devices/tech/dalvik/ |
| dalvik-bytecode.jd | 181 "<code>sparse-switch-payload</code> Format", and
589 <td>sparse-switch vAA, +BBBBBBBB <i>(with supplemental data as
590 specified below in "<code>sparse-switch-payload</code> Format")</i></td>
[all...] |
| /external/opencv/cv/include/ |
| cv.h | 487 it is a "sparse" optical flow, which is opposite to the previous 3 methods) */
501 /* Modification of a previous sparse optical flow algorithm to calculate
[all...] |
| /external/opencv3/modules/imgproc/include/opencv2/imgproc/ |
| imgproc_c.h | 630 is represented as a multi-dimensional sparse array CvSparseMat.
694 histogram bins in case of a sparse array.
[all...] |
| /dalvik/libdex/ |
| DexOpcodes.h | [all...] |
| /external/ImageMagick/utilities/ |
| mogrify.1 | 242 \-sparse-color method args
|
| mogrify.1.in | 242 \-sparse-color method args
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3basetree.c | 192 // ANTLR3 lists can be sparse, unlike Array Lists
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| CoroutineManager.java | 117 * sparse-array mechanism, it may be possible to raise or eliminate
|
| /external/ceres-solver/internal/ceres/ |
| graph_algorithms.h | 86 // multilevel incomplete QR preconditioner for large sparse
|
| linear_least_squares_problems.cc | 572 "lsqp.A = sparse(tmp(:, 1) + 1, tmp(:, 2) + 1, tmp(:, 3), %d, %d);\n",
|
| schur_eliminator.h | 124 // general sparse matrices, the algorithm here deals with one
|
| /external/clang/docs/ |
| DataFlowSanitizerDesign.rst | 80 the required space of label unions is sparse, which is a reasonable
|
