| /external/eigen/Eigen/src/SparseCore/ |
| SparseTranspose.h | 15 template<typename MatrixType> class TransposeImpl<MatrixType,Sparse>
29 // NOTE: VC10 and VC11 trigger an ICE if don't put typename TransposeImpl<MatrixType,Sparse>:: in front of Index,
30 // a typedef typename TransposeImpl<MatrixType,Sparse>::Index Index;
33 template<typename MatrixType> class TransposeImpl<MatrixType,Sparse>::InnerIterator
40 EIGEN_STRONG_INLINE InnerIterator(const TransposeImpl& trans, typename TransposeImpl<MatrixType,Sparse>::Index outer)
43 typename TransposeImpl<MatrixType,Sparse>::Index row() const { return Base::col(); }
44 typename TransposeImpl<MatrixType,Sparse>::Index col() const { return Base::row(); }
47 template<typename MatrixType> class TransposeImpl<MatrixType,Sparse>::ReverseInnerIterator
54 EIGEN_STRONG_INLINE ReverseInnerIterator(const TransposeImpl& xpr, typename TransposeImpl<MatrixType,Sparse>::Index outer)
57 typename TransposeImpl<MatrixType,Sparse>::Index row() const { return Base::col();
[all...] |
| SparseCwiseUnaryOp.h | 16 class CwiseUnaryOpImpl<UnaryOp,MatrixType,Sparse>
34 class CwiseUnaryOpImpl<UnaryOp,MatrixType,Sparse>::InnerIterator
35 : public CwiseUnaryOpImpl<UnaryOp,MatrixType,Sparse>::MatrixTypeIterator
38 typedef typename CwiseUnaryOpImpl<UnaryOp,MatrixType,Sparse>::MatrixTypeIterator Base;
57 class CwiseUnaryOpImpl<UnaryOp,MatrixType,Sparse>::ReverseInnerIterator
58 : public CwiseUnaryOpImpl<UnaryOp,MatrixType,Sparse>::MatrixTypeReverseIterator
61 typedef typename CwiseUnaryOpImpl<UnaryOp,MatrixType,Sparse>::MatrixTypeReverseIterator Base;
80 class CwiseUnaryViewImpl<ViewOp,MatrixType,Sparse>
98 class CwiseUnaryViewImpl<ViewOp,MatrixType,Sparse>::InnerIterator
99 : public CwiseUnaryViewImpl<ViewOp,MatrixType,Sparse>::MatrixTypeIterato
[all...] |
| SparseCwiseBinaryOp.h | 16 // 1 - sparse op dense
17 // 2 - dense op sparse
18 // 3 - sparse op sparse
23 // 1 - sparse op dense product sparse
25 // 2 - dense op sparse product sparse
27 // 3 - sparse op sparse product spars
[all...] |
| SparseView.h | 22 typedef Sparse StorageKind;
|
| SparseUtil.h | 97 template<typename T> struct eval<T,Sparse>
129 template<typename T> struct plain_matrix_type<T,Sparse>
|
| SparseDenseProduct.h | 46 typedef Sparse StorageKind;
138 static Scalar get(const _RhsNested &rhs, Index outer, Sparse = Sparse())
277 // dense = dense * sparse
|
| SparseBlock.h | 16 class BlockImpl<XprType,BlockRows,BlockCols,true,Sparse>
91 class BlockImpl<SparseMatrix<_Scalar, _Options, _Index>,BlockRows,BlockCols,true,Sparse>
278 class BlockImpl<const SparseMatrix<_Scalar, _Options, _Index>,BlockRows,BlockCols,true,Sparse>
415 /** Generic implementation of sparse Block expression.
419 class BlockImpl<XprType,BlockRows,BlockCols,InnerPanel,Sparse>
|
| 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");
|
| SparseProduct.h | 74 typedef Sparse StorageKind;
158 // sparse = sparse * sparse
167 /** \returns an expression of the product of two sparse matrices.
|
| SparseVector.h | 18 * \brief a sparse vector class
34 typedef Sparse StorageKind;
49 // Sparse-Vector-Assignment kinds:
|
| /external/llvm/include/llvm/ADT/ |
| SparseSet.h | 1 //===--- llvm/ADT/SparseSet.h - Sparse set ----------------------*- C++ -*-===//
11 // Briggs, Torczon, "An efficient representation for sparse sets", ACM Letters
14 // A sparse set holds a small number of objects identified by integer keys from
15 // a moderately sized universe. The sparse set uses more memory than other
97 /// SparseSet contains a dense vector holding all the objects and a sparse
99 /// the sparse array which is the size of the key universe. The SparseT
103 /// When SparseT is uint32_t, find() only touches 2 cache lines, but the sparse
107 /// lines, but the sparse array is 4x smaller. N is the number of elements in
129 SparseT *Sparse;
146 SparseSet() : Sparse(nullptr), Universe(0) {
[all...] |
| SparseMultiSet.h | 1 //===--- llvm/ADT/SparseMultiSet.h - Sparse multiset ------------*- C++ -*-===//
13 // A sparse multiset holds a small number of objects identified by integer keys
14 // from a moderately sized universe. The sparse multiset uses more memory than
47 /// SparseMultiSet contains a dense vector holding all the objects and a sparse
49 /// the sparse array which is the size of the key universe. The SparseT template
53 /// sparse array uses 4 x Universe bytes.
56 /// lines, but the sparse array is 4x smaller. N is the number of elements in
116 SparseT *Sparse;
191 : Sparse(nullptr), Universe(0), FreelistIdx(SMSNode::INVALID), NumFree(0) {}
193 ~SparseMultiSet() { free(Sparse); }
[all...] |
| /external/eigen/doc/special_examples/ |
| Tutorial_sparse_example.cpp | 1 #include <Eigen/Sparse>
4 typedef Eigen::SparseMatrix<double> SpMat; // declares a column-major sparse matrix type of double
|
| Tutorial_sparse_example_details.cpp | 1 #include <Eigen/Sparse>
5 typedef Eigen::SparseMatrix<double> SpMat; // declares a column-major sparse matrix type of double
|
| /external/v8/test/mjsunit/regress/ |
| regress-3643.js | 18 // Sparse case should hit the same code as above due to presence of the getter.
|
| /external/eigen/bench/ |
| sparse_lu.cpp | 6 #include <Eigen/Sparse>
|
| BenchSparseUtil.h | 2 #include <Eigen/Sparse>
|
| sparse_cholesky.cpp | 4 #include <Eigen/Sparse>
74 // std::cout << "sparse\n" << chol.matrixL() << "%\n";
93 std::cout << "Generate sparse matrix (might take a while)...\n";
126 // eigen sparse matrices
127 doEigen<Eigen::DefaultBackend>("Eigen/Sparse", sm1, Eigen::IncompleteFactorization);
|
| /external/eigen/test/eigen2/ |
| sparse.h | 28 #include <Eigen/Sparse>
37 /* Initializes both a sparse and dense matrix with same random values,
|
| /external/ceres-solver/scripts/ |
| ceres-solver.spec | 45 - Sparse Cholesky factorization (using SuiteSparse) for large sparse problems
47 - Iterative linear solvers for general sparse and bundle adjustment problems
|
| /external/eigen/test/ |
| sparse.h | 40 #include <Eigen/Sparse>
49 /* Initializes both a sparse and dense matrix with same random values,
|
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| DynamicSparseMatrix.h | 19 * \brief A sparse matrix class designed for matrix assembly purpose
41 typedef Sparse StorageKind;
|
| /external/opencv3/modules/cudaoptflow/test/ |
| test_optflow.cpp | 187 CUDA_TEST_P(PyrLKOpticalFlow, Sparse)
|
| /external/v8/test/mjsunit/ |
| array-indexing.js | 30 // Sparse arrays with length 42000.
79 // Find in sparse array.
146 // Find in sparse array.
|
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineMatrix.h | 37 typedef Sparse StorageKind;
|
