| /external/eigen/doc/ |
| I12_ClassHierarchy.dox | 73 diagonal matrices, sparse matrices, etc...
|
| I16_TemplateKeyword.dox | 99 for iterating over the non-zero entries of a sparse matrix type:
|
| QuickReference.dox | 34 <tr class="alt"><td>\link Sparse_Module Sparse \endlink</td><td>\code#include <Eigen/Sparse>\endcode</td><td>%Sparse matrix storage and related basic linear algebra (SparseMatrix, DynamicSparseMatrix, SparseVector)</td></tr>
36 <tr class="alt"><td></td><td>\code#include <Eigen/Eigen>\endcode</td><td>Includes %Dense and %Sparse header files (the whole Eigen library)</td></tr>
|
| UsingIntelMKL.dox | 64 Finally, the PARDISO sparse solver shipped with Intel MKL can be used through the \ref PardisoLU, \ref PardisoLLT and \ref PardisoLDLT classes of the \ref PARDISOSupport_Module.
|
| A10_Eigen2SupportModes.dox | 48 \li The Sparse module.
|
| /external/eigen/test/ |
| sparse_permutations.cpp | 10 #include "sparse.h"
|
| /external/harfbuzz_ng/src/ |
| gen-indic-table.py | 208 raise Exception ("Table too sparse, please investigate: ", occupancy)
|
| /external/icu4c/common/ |
| propname.h | 205 * in a property's sparse value ranges.
|
| /external/libvpx/libvpx/examples/includes/geshi/geshi/ |
| matlab.php | 131 'sortrows','sound','soundsc','spalloc','sparse','spconvert',
|
| /external/openfst/src/include/ |
| Makefile.in | 81 fst/signed-log-weight.h fst/sparse-tuple-weight.h \
82 fst/sparse-power-weight.h fst/expectation-weight.h \
335 fst/sparse-tuple-weight.h fst/sparse-power-weight.h fst/expectation-weight.h \
|
| /external/openfst/src/include/fst/ |
| arc.h | 34 #include <fst/sparse-power-weight.h>
|
| /external/smali/smali/src/test/resources/LexerTest/ |
| InstructionTest.smali | 203 sparse-switch
|
| InstructionTest.tokens | 203 INSTRUCTION_FORMAT31t("sparse-switch")
|
| /cts/tools/dasm/src/dasm/ |
| parser.cup | 736 // sparse-switch <table>
809 // sparse-switch register
813 // sparse-switch-end
|
| /external/smali/smali/src/main/jflex/ |
| smaliLexer.flex | 252 ".sparse-switch" { return newToken(SPARSE_SWITCH_DIRECTIVE); }
253 ".end sparse-switch" { return newToken(END_SPARSE_SWITCH_DIRECTIVE); }
528 "fill-array-data" | "packed-switch" | "sparse-switch" {
|
| /external/llvm/lib/Transforms/Scalar/ |
| SCCP.cpp | 1 //===- SCCP.cpp - Sparse Conditional Constant Propagation -----------------===//
10 // This file implements sparse conditional constant propagation and merging:
152 /// SCCPSolver - This class is a general purpose solver for Sparse Conditional
[all...] |
| /external/bison/lib/ |
| lbitset.c | 33 large sparse sets.
43 but the more memory wasted for sparse bitsets and the longer the time
919 bitset! It makes a sparse bitset become dense. An alternative
|
| bitset.h | 38 BITSET_SPARSE = 8, /* Bitset sparse. */
|
| /external/ceres-solver/internal/ceres/ |
| graph_algorithms.h | 69 // multilevel incomplete QR preconditioner for large sparse
|
| suitesparse.cc | 213 // This loop extracts the block sparsity of the scalar sparse matrix
|
| /external/chromium-trace/trace-viewer/src/tracks/ |
| counter_track.js | 61 * @return {Object} A sparse, mutable map from sample index to bool. Samples
|
| /external/clang/utils/ |
| clang-completion-mode.el | 218 (setq clang-completion-mode-map (make-sparse-keymap))))
|
| /external/e2fsprogs/resize/ |
| main.c | 427 * automatically extend it in a sparse fashion by writing the
|
| /external/guava/guava/src/com/google/common/collect/ |
| Table.java | 31 * column key, with a single value. A table may be sparse, with only a small
|
| /external/llvm/include/llvm/CodeGen/ |
| RegisterPressure.h | 128 /// Virtual and physical register numbers require separate sparse sets, but most
|
