mirror/eigen
2
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2024-12-21 07:19:46 +08:00
Code Issues Packages Projects Releases Wiki Activity

Some warning fixes

Browse Source
This commit is contained in:
Gael Guennebaud 2018-07-17 10:29:12 +02:00
parent 40797dbea3
commit 5539587b1f
3 changed files with 1 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Eigen/src/Householder/HouseholderSequence.h
View File

@ -356,7 +356,7 @@ template<typename VectorsType, typename CoeffsType, int Side> class HouseholderS
if(m_length>=BlockSize && dst.cols()>1)
{
// Make sure we have at least 2 useful blocks, otherwise it is point-less:
Index blockSize = m_length<2*BlockSize ? (m_length+1)/2 : BlockSize;
Index blockSize = m_length<Index(2*BlockSize) ? (m_length+1)/2 : Index(BlockSize);
for(Index i = 0; i < m_length; i+=blockSize)
{
Index end = m_reverse ? (std::min)(m_length,i+blockSize) : m_length-i;

3
Eigen/src/SparseLU/SparseLU.h
View File

@ -499,11 +499,8 @@ void SparseLU<MatrixType, OrderingType>::factorize(const MatrixType& matrix)
eigen_assert(m_analysisIsOk && "analyzePattern() should be called first");
eigen_assert((matrix.rows() == matrix.cols()) && "Only for squared matrices");
typedef typename IndexVector::Scalar StorageIndex;
m_isInitialized = true;
// Apply the column permutation computed in analyzepattern()
// m_mat = matrix * m_perm_c.inverse();
m_mat = matrix;

1
unsupported/Eigen/src/IterativeSolvers/DGMRES.h
View File

@ -392,7 +392,6 @@ inline typename DGMRES<_MatrixType, _Preconditioner>::ComplexVector DGMRES<_Matr
template< typename _MatrixType, typename _Preconditioner>
inline typename DGMRES<_MatrixType, _Preconditioner>::ComplexVector DGMRES<_MatrixType, _Preconditioner>::schurValues(const RealSchur<DenseMatrix>& schurofH) const
{
typedef typename MatrixType::Index Index;
const DenseMatrix& T = schurofH.matrixT();
Index it = T.rows();
ComplexVector eig(it);