/external/eigen/Eigen/src/SparseCore/ |
H A D | SparseBlock.h | 132 SparseMatrix<Scalar, IsRowMajor ? RowMajor : ColMajor, Index> tmp(other);
|
H A D | SparseDenseProduct.h | 161 int LhsStorageOrder = ((SparseLhsType::Flags&RowMajorBit)==RowMajorBit) ? RowMajor : ColMajor, 190 struct sparse_time_dense_product_impl<SparseLhsType,DenseRhsType,DenseResType, ColMajor, true> 231 struct sparse_time_dense_product_impl<SparseLhsType,DenseRhsType,DenseResType, ColMajor, false>
|
H A D | SparseMatrix.h | 34 * is ColMajor or RowMajor. The default is 0 which means column-major. 854 EIGEN_STATIC_ASSERT((Options&(ColMajor|RowMajor))==Options,INVALID_MATRIX_TEMPLATE_PARAMETERS); 943 SparseMatrix<Scalar,IsRowMajor?ColMajor:RowMajor,Index> trMat(mat.rows(),mat.cols());
|
H A D | SparseMatrixBase.h | 108 typedef SparseMatrix<Scalar, Flags&RowMajorBit ? RowMajor : ColMajor, Index> PlainObject;
|
H A D | SparsePermutation.h | 26 SrcStorageOrder = MatrixTypeNestedCleaned::Flags&RowMajorBit ? RowMajor : ColMajor, 32 SparseMatrix<Scalar,int(SrcStorageOrder)==RowMajor?ColMajor:RowMajor,Index> >::type ReturnType; 44 SrcStorageOrder = MatrixTypeNestedCleaned::Flags&RowMajorBit ? RowMajor : ColMajor, 79 SparseMatrix<Scalar,int(SrcStorageOrder)==RowMajor?ColMajor:RowMajor,Index> tmp(m_matrix.rows(), m_matrix.cols());
|
H A D | SparseSelfAdjointView.h | 129 template<typename DestScalar> void evalTo(DynamicSparseMatrix<DestScalar,ColMajor,Index>& _dest) const 132 SparseMatrix<DestScalar,ColMajor,Index> tmp(_dest.rows(),_dest.cols()); 202 SparseMatrix<Scalar,MatrixType::Flags&RowMajorBit?RowMajor:ColMajor> tmp = u * u.adjoint(); 408 SrcOrder = MatrixType::IsRowMajor ? RowMajor : ColMajor, 489 SparseMatrix<DestScalar,(Options&RowMajor)==RowMajor ? ColMajor : RowMajor, DstIndex> tmp;
|
H A D | SparseSparseProductWithPruning.h | 83 struct sparse_sparse_product_with_pruning_selector<Lhs,Rhs,ResultType,ColMajor,ColMajor,ColMajor> 97 struct sparse_sparse_product_with_pruning_selector<Lhs,Rhs,ResultType,ColMajor,ColMajor,RowMajor> 103 typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename ResultType::Index> SparseTemporaryType; 124 struct sparse_sparse_product_with_pruning_selector<Lhs,Rhs,ResultType,RowMajor,RowMajor,ColMajor> 129 typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename Lhs::Index> ColMajorMatrixLhs; 130 typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename Lhs::Index> ColMajorMatrixRhs;
|
H A D | SparseUtil.h | 112 typedef SparseVector<_Scalar, ColMajor, _Index> type; 118 enum { _Options = ((traits<T>::Flags&RowMajorBit)==RowMajorBit) ? RowMajor : ColMajor }; 133 enum { _Options = ((traits<T>::Flags&RowMajorBit)==RowMajorBit) ? RowMajor : ColMajor };
|
H A D | SparseVector.h | 340 EIGEN_STATIC_ASSERT((_Options&(ColMajor|RowMajor))==Options,INVALID_MATRIX_TEMPLATE_PARAMETERS);
|
H A D | TriangularSolver.h | 100 struct sparse_solve_triangular_selector<Lhs,Rhs,Mode,Lower,ColMajor> 132 struct sparse_solve_triangular_selector<Lhs,Rhs,Mode,Upper,ColMajor> 208 struct sparse_solve_triangular_sparse_selector<Lhs,Rhs,Mode,UpLo,ColMajor>
|
/external/eigen/Eigen/src/SparseLU/ |
H A D | SparseLU.h | 46 * SparseMatrix<double, ColMajor> A; 47 * SparseLU<SparseMatrix<scalar, ColMajor>, COLAMDOrdering<Index> > solver; 81 typedef SparseMatrix<Scalar,ColMajor,Index> NCMatrix; 144 SparseLUMatrixUReturnType<SCMatrix,MappedSparseMatrix<Scalar,ColMajor,Index> > matrixU() const 146 return SparseLUMatrixUReturnType<SCMatrix, MappedSparseMatrix<Scalar,ColMajor,Index> >(m_Lstore, m_Ustore); 337 MappedSparseMatrix<Scalar,ColMajor,Index> m_Ustore; // The upper triangular matrix 649 new (&m_Ustore) MappedSparseMatrix<Scalar, ColMajor, Index> ( m, n, m_nnzU, m_glu.xusub.data(), m_glu.usub.data(), m_glu.ucol.data() );
|
H A D | SparseLUImpl.h | 29 typedef SparseMatrix<Scalar,ColMajor,Index> MatrixType;
|
/external/eigen/Eigen/src/SparseQR/ |
H A D | SparseQR.h | 73 typedef SparseMatrix<Scalar,ColMajor,Index> QRMatrixType;
|
/external/eigen/Eigen/src/SuperLUSupport/ |
H A D | SuperLUSupport.h | 275 || (Flags&ColMajor)==ColMajor && sluMat.Stype == SLU_NC);
|
/external/eigen/Eigen/src/UmfPackSupport/ |
H A D | UmfPackSupport.h | 135 typedef SparseMatrix<Scalar,ColMajor,int> UmfpackMatrixType;
|
/external/eigen/bench/spbench/ |
H A D | sp_solver.cpp | 22 SparseMatrix<double, ColMajor> A; 23 typedef SparseMatrix<double, ColMajor>::Index Index; 28 //SparseLU<SparseMatrix<double, ColMajor> > solver; 29 // SuperLU<SparseMatrix<double, ColMajor> > solver; 30 ConjugateGradient<SparseMatrix<double, ColMajor>, Lower,IncompleteCholesky<double,Lower> > solver; 49 SparseMatrix<double, ColMajor> temp;
|
H A D | spbenchsolver.h | 307 typedef SparseMatrix<Scalar, ColMajor> SpMat;
|
H A D | test_sparseLU.cpp | 21 SparseMatrix<scalar, ColMajor> A; 22 typedef SparseMatrix<scalar, ColMajor>::Index Index; 26 // SparseLU<SparseMatrix<scalar, ColMajor>, AMDOrdering<int> > solver; 28 // SparseLU<SparseMatrix<scalar, ColMajor>, MetisOrdering<int> > solver; 31 SparseLU<SparseMatrix<scalar, ColMajor>, COLAMDOrdering<int> > solver; 51 SparseMatrix<scalar, ColMajor> temp;
|
/external/eigen/blas/ |
H A D | BandTriangularSolver.h | 59 struct band_solve_triangular_selector<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ColMajor> 61 typedef Map<const Matrix<LhsScalar,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> > LhsMap;
|
H A D | GeneralRank1Update.h | 20 struct general_rank1_update<Scalar,Index,ColMajor,ConjLhs,ConjRhs> 38 general_rank1_update<Scalar,Index,ColMajor,ConjRhs,ConjRhs>::run(rows,cols,mat,stride,u,v,alpha);
|
H A D | PackedSelfadjointProduct.h | 22 struct selfadjoint_packed_rank1_update<Scalar,Index,ColMajor,UpLo,ConjLhs,ConjRhs> 47 selfadjoint_packed_rank1_update<Scalar,Index,ColMajor,UpLo==Lower?Upper:Lower,ConjRhs,ConjLhs>::run(size,mat,vec,alpha);
|
H A D | PackedTriangularMatrixVector.h | 19 struct packed_triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,ColMajor>
|
H A D | PackedTriangularSolverVector.h | 48 struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mode, Conjugate, ColMajor> 81 Conjugate,StorageOrder==RowMajor?ColMajor:RowMajor
|
H A D | common.h | 96 typedef Matrix<Scalar,Dynamic,Dynamic,ColMajor> PlainMatrixType; 97 typedef Map<Matrix<Scalar,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> > MatrixType; 102 Map<Matrix<T,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> > 105 return Map<Matrix<T,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> >(data, rows, cols, OuterStride<>(stride));
|
H A D | level2_cplx_impl.h | 30 func[UP] = (internal::selfadjoint_matrix_vector_product<Scalar,int,ColMajor,Upper,false,false>::run); 31 func[LO] = (internal::selfadjoint_matrix_vector_product<Scalar,int,ColMajor,Lower,false,false>::run); 122 func[UP] = (internal::selfadjoint_packed_rank1_update<Scalar,int,ColMajor,Upper,false,Conj>::run); 123 func[LO] = (internal::selfadjoint_packed_rank1_update<Scalar,int,ColMajor,Lower,false,Conj>::run); 228 func[UP] = (selfadjoint_rank1_update<Scalar,int,ColMajor,Upper,false,Conj>::run); 229 func[LO] = (selfadjoint_rank1_update<Scalar,int,ColMajor,Lower,false,Conj>::run); 351 internal::general_rank1_update<Scalar,int,ColMajor,false,false>::run(*m, *n, a, *lda, x_cpy, y_cpy, alpha); 388 internal::general_rank1_update<Scalar,int,ColMajor,false,Conj>::run(*m, *n, a, *lda, x_cpy, y_cpy, alpha);
|