devtools/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2026-04-10 11:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

add sparse sort inner vectors function

Browse Source
This commit is contained in:
Charles Schlosser
2022-12-01 19:28:56 +00:00
committed by Antonio Sánchez
parent d194167149
commit 44fe539150
3 changed files with 285 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
test/sparse_vector.cpp
View File

@@ -143,6 +143,33 @@ template<typename Scalar,typename StorageIndex> void sparse_vector(int rows, int
}
}
// test sort
if(rows > 1)
{
SparseVectorType vec1(rows);
DenseVector refVec1 = DenseVector::Zero(rows);
DenseVector innerIndices(rows);
innerIndices.setLinSpaced(0, rows - 1);
std::random_shuffle(innerIndices.begin(), innerIndices.end());
Index nz = internal::random<Index>(2, rows / 2);
for (Index k = 0; k < nz; k++)
{
Index i = innerIndices[k];
Scalar val = internal::random<Scalar>();
refVec1.coeffRef(i) = val;
vec1.insert(i) = val;
}
vec1.template sortInnerIndices<std::greater<>>();
VERIFY_IS_APPROX(vec1, refVec1);
VERIFY_IS_EQUAL(vec1.template innerIndicesAreSorted<std::greater<>>(), 1);
VERIFY_IS_EQUAL(vec1.template innerIndicesAreSorted<std::less<>>(), 0);
vec1.template sortInnerIndices<std::less<>>();
VERIFY_IS_APPROX(vec1, refVec1);
VERIFY_IS_EQUAL(vec1.template innerIndicesAreSorted<std::greater<>>(), 0);
VERIFY_IS_EQUAL(vec1.template innerIndicesAreSorted<std::less<>>(), 1);
}
}
void test_pruning() {
using SparseVectorType = SparseVector<double, 0, int>;