/external/eigen/Eigen/src/SparseCore/ |
H A D | SparseTranspose.h | 15 template<typename MatrixType> class TransposeImpl<MatrixType,Sparse> 29 // NOTE: VC10 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 39 EIGEN_STRONG_INLINE InnerIterator(const TransposeImpl& trans, typename TransposeImpl<MatrixType,Sparse>::Index outer) 42 inline typename TransposeImpl<MatrixType,Sparse>::Index row() const { return Base::col(); } 43 inline typename TransposeImpl<MatrixType,Sparse>::Index col() const { return Base::row(); } 46 template<typename MatrixType> class TransposeImpl<MatrixType,Sparse>::ReverseInnerIterator 52 EIGEN_STRONG_INLINE ReverseInnerIterator(const TransposeImpl& xpr, typename TransposeImpl<MatrixType,Sparse>::Index outer) 55 inline typename TransposeImpl<MatrixType,Sparse> [all...] |
H A D | 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> [all...] |
H A D | SparseCwiseBinaryOp.h | 34 template<> struct promote_storage_type<Dense,Sparse> 35 { typedef Sparse ret; }; 37 template<> struct promote_storage_type<Sparse,Dense> 38 { typedef Sparse ret; }; 48 class CwiseBinaryOpImpl<BinaryOp, Lhs, Rhs, Sparse> 68 class CwiseBinaryOpImpl<BinaryOp,Lhs,Rhs,Sparse>::InnerIterator 69 : public internal::sparse_cwise_binary_op_inner_iterator_selector<BinaryOp,Lhs,Rhs,typename CwiseBinaryOpImpl<BinaryOp,Lhs,Rhs,Sparse>::InnerIterator> 94 class sparse_cwise_binary_op_inner_iterator_selector<BinaryOp, Lhs, Rhs, Derived, Sparse, Sparse> 159 class sparse_cwise_binary_op_inner_iterator_selector<scalar_product_op<T>, Lhs, Rhs, Derived, Sparse, Spars [all...] |
H A D | SparseView.h | 22 typedef Sparse StorageKind;
|
H A D | SparseUtil.h | 96 template<typename T> struct eval<T,Sparse> 127 template<typename T> struct plain_matrix_type<T,Sparse>
|
H A D | SparseDiagonalProduct.h | 37 typedef Sparse StorageKind;
|
H A D | SparseProduct.h | 73 typedef Sparse StorageKind;
|
H A D | SparseDenseProduct.h | 40 typedef Sparse StorageKind;
|
H A D | SparseVector.h | 34 typedef Sparse StorageKind;
|
H A D | SparseMatrix.h | 47 typedef Sparse StorageKind;
|
/external/llvm/include/llvm/ADT/ |
H A D | SparseSet.h | 1 //===--- llvm/ADT/SparseSet.h - Sparse set ----------------------*- C++ -*-===// 124 SparseT *Sparse; member in class:llvm::SparseSet 141 SparseSet() : Sparse(0), Universe(0) {} 142 ~SparseSet() { free(Sparse); } 157 free(Sparse); 158 // The Sparse array doesn't actually need to be initialized, so malloc 161 Sparse = reinterpret_cast<SparseT*>(calloc(U, sizeof(SparseT))); 190 // Sparse does not need to be cleared, see find(). 205 for (unsigned i = Sparse[Idx], e = size(); i < e; i += Stride) { 251 Sparse[Id [all...] |
H A D | SparseMultiSet.h | 1 //===--- llvm/ADT/SparseMultiSet.h - Sparse multiset ------------*- C++ -*-===// 112 SparseT *Sparse; member in class:llvm::SparseMultiSet 186 : Sparse(0), Universe(0), FreelistIdx(SMSNode::INVALID), NumFree(0) { } 188 ~SparseMultiSet() { free(Sparse); } 202 free(Sparse); 203 // The Sparse array doesn't actually need to be initialized, so malloc 206 Sparse = reinterpret_cast<SparseT*>(calloc(U, sizeof(SparseT))); 344 // Sparse does not need to be cleared, see find(). 361 for (unsigned i = Sparse[Idx], e = Dense.size(); i < e; i += Stride) { 431 Sparse[Id [all...] |
/external/eigen/doc/special_examples/ |
H A D | Tutorial_sparse_example.cpp | 1 #include <Eigen/Sparse>
|
H A D | Tutorial_sparse_example_details.cpp | 1 #include <Eigen/Sparse>
|
/external/eigen/bench/ |
H A D | sparse_lu.cpp | 6 #include <Eigen/Sparse>
|
H A D | BenchSparseUtil.h | 2 #include <Eigen/Sparse>
|
H A D | sparse_cholesky.cpp | 4 #include <Eigen/Sparse> 127 doEigen<Eigen::DefaultBackend>("Eigen/Sparse", sm1, Eigen::IncompleteFactorization);
|
/external/eigen/test/eigen2/ |
H A D | sparse.h | 28 #include <Eigen/Sparse>
|
/external/ceres-solver/scripts/ |
H A D | ceres-solver.spec | 44 - Sparse Cholesky factorization (using SuiteSparse) for large sparse problems
|
/external/eigen/test/ |
H A D | sparse.h | 40 #include <Eigen/Sparse>
|
/external/eigen/unsupported/Eigen/src/SparseExtra/ |
H A D | DynamicSparseMatrix.h | 41 typedef Sparse StorageKind;
|
/external/eigen/unsupported/Eigen/src/Skyline/ |
H A D | SkylineMatrix.h | 37 typedef Sparse StorageKind;
|