| /dalvik/dx/src/com/android/dx/io/ |
| OpcodeInfo.java | 52 new Info(Opcodes.SPARSE_SWITCH_PAYLOAD, "sparse-switch-payload",
239 new Info(Opcodes.SPARSE_SWITCH, "sparse-switch",
[all...] |
| /dalvik/vm/compiler/codegen/x86/ |
| LowerJump.cpp | 779 //handle fill_array_data, packed switch & sparse switch
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/io/ |
| OpcodeInfo.java | 52 new Info(Opcodes.SPARSE_SWITCH_PAYLOAD, "sparse-switch-payload",
239 new Info(Opcodes.SPARSE_SWITCH, "sparse-switch",
[all...] |
| /external/e2fsprogs/misc/ |
| tune2fs.c | [all...] |
| mke2fs.8.in | 243 on solid state devices and sparse / thin-provisioned storage). When the device
|
| tune2fs.8.in | 49 .I sparse-super-flag
|
| /dalvik/libdex/ |
| DexFile.h | 454 * there's less of a penalty for using a fairly sparse table.
|
| ZipArchive.cpp | 450 * This currently involves walking through the sparse hash table, counting
|
| /dalvik/opcode-gen/ |
| bytecode.txt | 130 op 2c sparse-switch 31t n none continue|switch
|
| /dalvik/tools/dexdeps/src/com/android/dexdeps/ |
| DexData.java | 357 // create a sparse array of ClassRef that parallels mTypeIds
|
| /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-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/internal/ceres/ |
| linear_least_squares_problems.cc | 704 "lsqp.A = sparse(tmp(:, 1) + 1, tmp(:, 2) + 1, tmp(:, 3), %d, %d);\n",
|
| visibility_based_preconditioner.cc | 431 // Compute the sparse Cholesky factorization of the preconditioner
|
| /external/chromium/chrome/common/extensions/docs/static/ |
| i18n.html | 318 your extension will run no matter how sparse a translation is.
|
| /external/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 335 // 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 | 15 http://www.cise.ufl.edu/research/sparse/CSparse
|
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineMatrix.h | 37 typedef Sparse StorageKind;
|
| /external/guava/guava/src/com/google/common/collect/ |
| ArrayTable.java | 59 * TreeBasedTable} implementations, except when the table is sparse.
|
| /external/icu4c/common/ |
| ucnvmbcs.h | 94 * and is free in empty blocks. (Larger blocks with sparse contents cause larger
|
| /external/libvorbis/doc/ |
| 01-introduction.tex | 251 ordered or unordered, or the tree is sparse.
|
| /external/libvorbis/lib/ |
| sharedbook.c | 331 First, we collapse the likely sparse codebook down only to
|
| /external/llvm/docs/ |
| Passes.rst | 709 ``-ipsccp``: Interprocedural Sparse Conditional Constant Propagation
712 An interprocedural variant of :ref:`Sparse Conditional Constant Propagation
[all...] |
