| /external/smali/dexlib2/src/main/java/org/jf/dexlib2/ |
| Opcode.java | 88 SPARSE_SWITCH(0x2c, "sparse-switch", ReferenceType.NONE, Format.Format31t, Opcode.CAN_CONTINUE),
[all...] |
| /external/v8/src/ |
| objects-printer.cc | 330 // Print in array notation for non-sparse arrays.
339 // Print in array notation for non-sparse arrays.
[all...] |
| /art/runtime/ |
| dex_instruction_list.h | 65 V(0x2C, SPARSE_SWITCH, "sparse-switch", k31t, false, kIndexNone, kContinue | kSwitch, kVerifyRegA | kVerifySwitchTargets) \
[all...] |
| /art/tools/dexfuzz/src/dexfuzz/program/ |
| CodeTranslator.java | 414 // Dealing with a sparse-switch.
|
| /dalvik/libdex/ |
| DexFile.h | 496 * there's less of a penalty for using a fairly sparse table.
|
| /dalvik/opcode-gen/ |
| bytecode.txt | 130 op 2c sparse-switch 31t n none continue|switch
|
| /dalvik/tools/dexdeps/src/com/android/dexdeps/ |
| DexData.java | 358 // create a sparse array of ClassRef that parallels mTypeIds
|
| /external/ImageMagick/utilities/ |
| convert.1.in | 245 \-sparse-color method args
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 232 * sparse list, so if any element is deleted, then the ones following are moved
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| AbstractRealVector.java | 867 * make their own sparse iterator, not use this one.
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| CharInfo.java | 395 * Long-term solution would be to replace the hashtable with a sparse array
|
| /external/bison/lib/ |
| ebitset.c | 30 large sparse sets.
|
| /external/ceres-solver/examples/ |
| ellipse_approximation.cc | 36 // dense but dynamically sparse.
|
| /external/ceres-solver/internal/ceres/ |
| covariance_impl.cc | 472 // sparse matrix.
|
| schur_eliminator_impl.h | 427 // which are zero compressed versions of the block sparse matrices E'E
|
| visibility_based_preconditioner.cc | 428 // Compute the sparse Cholesky factorization of the preconditioner
|
| /external/clang/docs/ |
| ControlFlowIntegrityDesign.rst | 457 implemented as a sparse array of 2 bytes for every possible page (4096
|
| /external/e2fsprogs/ |
| TODO | 226 I/O manager, in a compact, non-sparse format containing the intended
|
| /external/e2fsprogs/lib/ext2fs/ |
| gen_bitmap64.c | 66 * loop detections in pass 3, the bitmap will *always* be sparse, so
|
| unix_io.c | 541 * and if it succeed, subsequent read from sparse area returns
|
| /external/e2fsprogs/misc/ |
| mke2fs.8.in | 288 on solid state devices and sparse / thin-provisioned storage). When the device
|
| tune2fs.8.in | 49 .I sparse-super-flag
|
| /external/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 347 // Modifications of a Sparse Cholesky Factorization" (Algorithm 1)
|
| /external/eigen/Eigen/src/Core/ |
| GeneralProduct.h | 27 * This excludes triangular, selfadjoint, and sparse matrices.
|
| /external/eigen/Eigen/src/OrderingMethods/ |
| Amd.h | 11 http://www.cise.ufl.edu/research/sparse/CSparse
|
