| /external/eigen/doc/ |
| SparseQuickReference.dox | 2 /** \eigenManualPage SparseQuickRefPage Quick reference guide for sparse matrices
7 In this page, we give a quick summary of the main operations available for sparse matrices in the class SparseMatrix. First, it is recommended to read the introductory tutorial at \ref TutorialSparse. The important point to have in mind when working on sparse matrices is how they are stored :
8 i.e either row major or column major. The default is column major. Most arithmetic operations on sparse matrices will assert that they have the same storage order.
10 \section SparseMatrixInit Sparse Matrix Initialization
95 sm1.isVector(); // Check if sm1 is a sparse vector or a sparse matrix
103 It is easy to perform arithmetic operations on sparse matrices provided that the dimensions are adequate and that the matrices have the same storage order. Note that the evaluation can always be done in a matrix with a different storage order. In the following, \b sm denotes a sparse matrix, \b dm a dense matrix and \b dv a dense vector.
130 <td> %Sparse %Product </td
[all...] |
| /external/eigen/test/ |
| spqr_support.cpp | 8 #include "sparse.h"
43 std::cerr << "sparse QR factorization failed\n";
50 std::cerr << "sparse QR factorization failed\n";
|
| /system/core/libsparse/ |
| simg2img.c | 17 #include <sparse/sparse.h>
69 fprintf(stderr, "Failed to read sparse file\n");
|
| img2simg.c | 30 #include <sparse/sparse.h>
94 fprintf(stderr, "Failed to create sparse file\n");
107 fprintf(stderr, "Failed to write sparse file\n");
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRIntArray.m | 41 @synthesize SPARSE;
62 SPARSE = NO;
76 SPARSE = NO;
140 if ( SPARSE==NO && anIndex > idx ) {
143 else if ( SPARSE == YES && anIndex >= BuffSize ) {
157 if ( SPARSE==NO && anIndex > idx ) {
160 } else if ( SPARSE==YES && anIndex >= BuffSize ) {
169 if ( SPARSE == NO && anIndex > idx ) {
172 else if ( SPARSE == YES && anIndex >= BuffSize ) {
|
| /external/autotest/client/tests/wb_kupdate/ |
| README | 3 This tests checks the wb_kupdate code path by writting data to a sparse file
|
| /external/deqp/external/vulkancts/modules/vulkan/sparse_resources/ |
| vktSparseResourcesTests.cpp | 21 * \brief Sparse Resources Tests
35 namespace sparse namespace in namespace:vkt
40 de::MovePtr<tcu::TestCaseGroup> sparseTests (new tcu::TestCaseGroup(testCtx, "sparse_resources", "Sparse Resources Tests"));
52 } // sparse
|
| /external/eigen/Eigen/ |
| PardisoSupport | 15 * This module brings support for the Intel(R) MKL PARDISO direct sparse solvers.
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseDiagonalProduct.h | 15 // The product of a diagonal matrix with a sparse matrix can be easily
18 // 1 - diag * row-major sparse
19 // => each inner vector <=> scalar * sparse vector product
21 // 2 - diag * col-major sparse
22 // => each inner vector <=> densevector * sparse vector cwise product
37 typedef Sparse StorageKind;
83 // We do not want ReverseInnerIterator for diagonal-sparse products,
84 // but this dummy declaration is needed to make diag * sparse * diag compile.
90 eigen_assert(lhs.cols() == rhs.rows() && "invalid sparse matrix * diagonal matrix product");
|
| /external/smali/smalidea/testData/ |
| InvalidInstruction.smalidea | 26 .sparse-switch
|
| /art/runtime/interpreter/mterp/mips64/ |
| op_packed_switch.S | 3 * Handle a packed-switch or sparse-switch instruction. In both cases
9 * for: packed-switch, sparse-switch
|
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/sparse_switch/d/ |
| T_sparse_switch_1.d | 30 sparse-switch v4
34 sparse-switch-end
|
| T_sparse_switch_11.d | 30 sparse-switch v4
34 sparse-switch-end
|
| T_sparse_switch_12.d | 29 sparse-switch v4
33 sparse-switch-end
|
| T_sparse_switch_13.d | 30 sparse-switch v4
34 sparse-switch-end
|
| T_sparse_switch_14.d | 31 sparse-switch v4
35 sparse-switch-end
|
| T_sparse_switch_2.d | 31 sparse-switch v4
35 sparse-switch-end
|
| T_sparse_switch_3.d | 31 sparse-switch v5
35 sparse-switch-end
|
| T_sparse_switch_4.d | 31 sparse-switch v3
35 sparse-switch-end
|
| T_sparse_switch_5.d | 31 sparse-switch v3
35 sparse-switch-end
|
| T_sparse_switch_6.d | 31 sparse-switch v3
35 sparse-switch-end
|
| T_sparse_switch_7.d | 30 sparse-switch v4
34 sparse-switch-end
|
| T_sparse_switch_8.d | 30 sparse-switch v4
34 sparse-switch-end
|
| T_sparse_switch_9.d | 30 sparse-switch v4
34 sparse-switch-end
|
| /dalvik/dx/tests/072-dex-switch-edge-cases/ |
| expected.txt | 56 0003: sparse-switch v2, 0010 // +000d
67 0010: sparse-switch-payload // for switch @ 0003
75 0003: sparse-switch v2, 0010 // +000d
86 0010: sparse-switch-payload // for switch @ 0003
94 0003: sparse-switch v2, 0010 // +000d
105 0010: sparse-switch-payload // for switch @ 0003
113 0003: sparse-switch v2, 0010 // +000d
124 0010: sparse-switch-payload // for switch @ 0003
|
