mirror of
https://gitlab.com/libeigen/eigen.git
synced 2025-08-12 03:39:01 +08:00
Fix bug #626: add assertion on input ranges for coeff* and insert members for sparse objects
This commit is contained in:
parent
4cf742525f
commit
a915f0292e
@ -170,6 +170,8 @@ class SparseMatrix
|
|||||||
* This function returns Scalar(0) if the element is an explicit \em zero */
|
* This function returns Scalar(0) if the element is an explicit \em zero */
|
||||||
inline Scalar coeff(Index row, Index col) const
|
inline Scalar coeff(Index row, Index col) const
|
||||||
{
|
{
|
||||||
|
eigen_assert(row>=0 && row<rows() && col>=0 && col<cols());
|
||||||
|
|
||||||
const Index outer = IsRowMajor ? row : col;
|
const Index outer = IsRowMajor ? row : col;
|
||||||
const Index inner = IsRowMajor ? col : row;
|
const Index inner = IsRowMajor ? col : row;
|
||||||
Index end = m_innerNonZeros ? m_outerIndex[outer] + m_innerNonZeros[outer] : m_outerIndex[outer+1];
|
Index end = m_innerNonZeros ? m_outerIndex[outer] + m_innerNonZeros[outer] : m_outerIndex[outer+1];
|
||||||
@ -186,6 +188,8 @@ class SparseMatrix
|
|||||||
*/
|
*/
|
||||||
inline Scalar& coeffRef(Index row, Index col)
|
inline Scalar& coeffRef(Index row, Index col)
|
||||||
{
|
{
|
||||||
|
eigen_assert(row>=0 && row<rows() && col>=0 && col<cols());
|
||||||
|
|
||||||
const Index outer = IsRowMajor ? row : col;
|
const Index outer = IsRowMajor ? row : col;
|
||||||
const Index inner = IsRowMajor ? col : row;
|
const Index inner = IsRowMajor ? col : row;
|
||||||
|
|
||||||
@ -215,6 +219,8 @@ class SparseMatrix
|
|||||||
*/
|
*/
|
||||||
Scalar& insert(Index row, Index col)
|
Scalar& insert(Index row, Index col)
|
||||||
{
|
{
|
||||||
|
eigen_assert(row>=0 && row<rows() && col>=0 && col<cols());
|
||||||
|
|
||||||
if(isCompressed())
|
if(isCompressed())
|
||||||
{
|
{
|
||||||
reserve(VectorXi::Constant(outerSize(), 2));
|
reserve(VectorXi::Constant(outerSize(), 2));
|
||||||
@ -281,7 +287,6 @@ class SparseMatrix
|
|||||||
template<class SizesType>
|
template<class SizesType>
|
||||||
inline void reserveInnerVectors(const SizesType& reserveSizes)
|
inline void reserveInnerVectors(const SizesType& reserveSizes)
|
||||||
{
|
{
|
||||||
|
|
||||||
if(isCompressed())
|
if(isCompressed())
|
||||||
{
|
{
|
||||||
std::size_t totalReserveSize = 0;
|
std::size_t totalReserveSize = 0;
|
||||||
@ -929,7 +934,10 @@ void set_from_triplets(const InputIterator& begin, const InputIterator& end, Spa
|
|||||||
VectorXi wi(trMat.outerSize());
|
VectorXi wi(trMat.outerSize());
|
||||||
wi.setZero();
|
wi.setZero();
|
||||||
for(InputIterator it(begin); it!=end; ++it)
|
for(InputIterator it(begin); it!=end; ++it)
|
||||||
|
{
|
||||||
|
eigen_assert(it->row()>=0 && it->row()<mat.rows() && it->col()>=0 && it->col()<mat.cols());
|
||||||
wi(IsRowMajor ? it->col() : it->row())++;
|
wi(IsRowMajor ? it->col() : it->row())++;
|
||||||
|
}
|
||||||
|
|
||||||
// pass 2: insert all the elements into trMat
|
// pass 2: insert all the elements into trMat
|
||||||
trMat.reserve(wi);
|
trMat.reserve(wi);
|
||||||
|
@ -83,14 +83,18 @@ class SparseVector
|
|||||||
|
|
||||||
inline Scalar coeff(Index row, Index col) const
|
inline Scalar coeff(Index row, Index col) const
|
||||||
{
|
{
|
||||||
eigen_assert((IsColVector ? col : row)==0);
|
eigen_assert(IsColVector ? (col==0 && row>=0 && row<m_size) : (row==0 && col>=0 && col<m_size));
|
||||||
return coeff(IsColVector ? row : col);
|
return coeff(IsColVector ? row : col);
|
||||||
}
|
}
|
||||||
inline Scalar coeff(Index i) const { return m_data.at(i); }
|
inline Scalar coeff(Index i) const
|
||||||
|
{
|
||||||
|
eigen_assert(i>=0 && i<m_size);
|
||||||
|
return m_data.at(i);
|
||||||
|
}
|
||||||
|
|
||||||
inline Scalar& coeffRef(Index row, Index col)
|
inline Scalar& coeffRef(Index row, Index col)
|
||||||
{
|
{
|
||||||
eigen_assert((IsColVector ? col : row)==0);
|
eigen_assert(IsColVector ? (col==0 && row>=0 && row<m_size) : (row==0 && col>=0 && col<m_size));
|
||||||
return coeff(IsColVector ? row : col);
|
return coeff(IsColVector ? row : col);
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -102,6 +106,7 @@ class SparseVector
|
|||||||
*/
|
*/
|
||||||
inline Scalar& coeffRef(Index i)
|
inline Scalar& coeffRef(Index i)
|
||||||
{
|
{
|
||||||
|
eigen_assert(i>=0 && i<m_size);
|
||||||
return m_data.atWithInsertion(i);
|
return m_data.atWithInsertion(i);
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -135,6 +140,8 @@ class SparseVector
|
|||||||
|
|
||||||
inline Scalar& insert(Index row, Index col)
|
inline Scalar& insert(Index row, Index col)
|
||||||
{
|
{
|
||||||
|
eigen_assert(IsColVector ? (col==0 && row>=0 && row<m_size) : (row==0 && col>=0 && col<m_size));
|
||||||
|
|
||||||
Index inner = IsColVector ? row : col;
|
Index inner = IsColVector ? row : col;
|
||||||
Index outer = IsColVector ? col : row;
|
Index outer = IsColVector ? col : row;
|
||||||
eigen_assert(outer==0);
|
eigen_assert(outer==0);
|
||||||
@ -142,6 +149,8 @@ class SparseVector
|
|||||||
}
|
}
|
||||||
Scalar& insert(Index i)
|
Scalar& insert(Index i)
|
||||||
{
|
{
|
||||||
|
eigen_assert(i>=0 && i<m_size);
|
||||||
|
|
||||||
Index startId = 0;
|
Index startId = 0;
|
||||||
Index p = Index(m_data.size()) - 1;
|
Index p = Index(m_data.size()) - 1;
|
||||||
// TODO smart realloc
|
// TODO smart realloc
|
||||||
|
@ -91,6 +91,10 @@ template<typename SparseMatrixType> void sparse_basic(const SparseMatrixType& re
|
|||||||
VERIFY_IS_APPROX(m.row(r) + m.row(r), refMat.row(r) + refMat.row(r));
|
VERIFY_IS_APPROX(m.row(r) + m.row(r), refMat.row(r) + refMat.row(r));
|
||||||
}
|
}
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
// test assertion
|
||||||
|
VERIFY_RAISES_ASSERT( m.coeffRef(-1,1) = 0 );
|
||||||
|
VERIFY_RAISES_ASSERT( m.coeffRef(0,m.cols()) = 0 );
|
||||||
}
|
}
|
||||||
|
|
||||||
// test insert (inner random)
|
// test insert (inner random)
|
||||||
|
Loading…
x
Reference in New Issue
Block a user