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

Clang-format tests, examples, libraries, benchmarks, etc.

Browse Source
This commit is contained in:
Antonio Sánchez
2023-12-05 21:22:55 +00:00
committed by Rasmus Munk Larsen
parent 3252ecc7a4
commit 46e9cdb7fe
876 changed files with 33453 additions and 37795 deletions
Download Patch File Download Diff File Expand all files Collapse all files

137
test/conservative_resize.cpp
View File

@@ -15,51 +15,47 @@
using namespace Eigen;
template <typename Scalar, int Storage>
void run_matrix_tests()
{
void run_matrix_tests() {
typedef Matrix<Scalar, Eigen::Dynamic, Eigen::Dynamic, Storage> MatrixType;
MatrixType m, n;
// boundary cases ...
m = n = MatrixType::Random(50,50);
m.conservativeResize(1,50);
VERIFY_IS_APPROX(m, n.block(0,0,1,50));
m = n = MatrixType::Random(50, 50);
m.conservativeResize(1, 50);
VERIFY_IS_APPROX(m, n.block(0, 0, 1, 50));
m = n = MatrixType::Random(50,50);
m.conservativeResize(50,1);
VERIFY_IS_APPROX(m, n.block(0,0,50,1));
m = n = MatrixType::Random(50, 50);
m.conservativeResize(50, 1);
VERIFY_IS_APPROX(m, n.block(0, 0, 50, 1));
m = n = MatrixType::Random(50,50);
m.conservativeResize(50,50);
VERIFY_IS_APPROX(m, n.block(0,0,50,50));
m = n = MatrixType::Random(50, 50);
m.conservativeResize(50, 50);
VERIFY_IS_APPROX(m, n.block(0, 0, 50, 50));
// random shrinking ...
for (int i=0; i<25; ++i)
{
const Index rows = internal::random<Index>(1,50);
const Index cols = internal::random<Index>(1,50);
m = n = MatrixType::Random(50,50);
m.conservativeResize(rows,cols);
VERIFY_IS_APPROX(m, n.block(0,0,rows,cols));
for (int i = 0; i < 25; ++i) {
const Index rows = internal::random<Index>(1, 50);
const Index cols = internal::random<Index>(1, 50);
m = n = MatrixType::Random(50, 50);
m.conservativeResize(rows, cols);
VERIFY_IS_APPROX(m, n.block(0, 0, rows, cols));
}
// random growing with zeroing ...
for (int i=0; i<25; ++i)
{
const Index rows = internal::random<Index>(50,75);
const Index cols = internal::random<Index>(50,75);
m = n = MatrixType::Random(50,50);
m.conservativeResizeLike(MatrixType::Zero(rows,cols));
VERIFY_IS_APPROX(m.block(0,0,n.rows(),n.cols()), n);
VERIFY( rows<=50 || m.block(50,0,rows-50,cols).sum() == Scalar(0) );
VERIFY( cols<=50 || m.block(0,50,rows,cols-50).sum() == Scalar(0) );
for (int i = 0; i < 25; ++i) {
const Index rows = internal::random<Index>(50, 75);
const Index cols = internal::random<Index>(50, 75);
m = n = MatrixType::Random(50, 50);
m.conservativeResizeLike(MatrixType::Zero(rows, cols));
VERIFY_IS_APPROX(m.block(0, 0, n.rows(), n.cols()), n);
VERIFY(rows <= 50 || m.block(50, 0, rows - 50, cols).sum() == Scalar(0));
VERIFY(cols <= 50 || m.block(0, 50, rows, cols - 50).sum() == Scalar(0));
}
}
template <typename Scalar>
void run_vector_tests()
{
void run_vector_tests() {
typedef Matrix<Scalar, 1, Eigen::Dynamic> VectorType;
VectorType m, n;
@@ -67,54 +63,52 @@ void run_vector_tests()
// boundary cases ...
m = n = VectorType::Random(50);
m.conservativeResize(1);
VERIFY_IS_APPROX(m, n.segment(0,1));
VERIFY_IS_APPROX(m, n.segment(0, 1));
m = n = VectorType::Random(50);
m.conservativeResize(50);
VERIFY_IS_APPROX(m, n.segment(0,50));
m = n = VectorType::Random(50);
m.conservativeResize(m.rows(),1);
VERIFY_IS_APPROX(m, n.segment(0,1));
VERIFY_IS_APPROX(m, n.segment(0, 50));
m = n = VectorType::Random(50);
m.conservativeResize(m.rows(),50);
VERIFY_IS_APPROX(m, n.segment(0,50));
m.conservativeResize(m.rows(), 1);
VERIFY_IS_APPROX(m, n.segment(0, 1));
m = n = VectorType::Random(50);
m.conservativeResize(m.rows(), 50);
VERIFY_IS_APPROX(m, n.segment(0, 50));
// random shrinking ...
for (int i=0; i<50; ++i)
{
const int size = internal::random<int>(1,50);
for (int i = 0; i < 50; ++i) {
const int size = internal::random<int>(1, 50);
m = n = VectorType::Random(50);
m.conservativeResize(size);
VERIFY_IS_APPROX(m, n.segment(0,size));
VERIFY_IS_APPROX(m, n.segment(0, size));
m = n = VectorType::Random(50);
m.conservativeResize(m.rows(), size);
VERIFY_IS_APPROX(m, n.segment(0,size));
VERIFY_IS_APPROX(m, n.segment(0, size));
}
// random growing with zeroing ...
for (int i=0; i<50; ++i)
{
const int size = internal::random<int>(50,100);
for (int i = 0; i < 50; ++i) {
const int size = internal::random<int>(50, 100);
m = n = VectorType::Random(50);
m.conservativeResizeLike(VectorType::Zero(size));
VERIFY_IS_APPROX(m.segment(0,50), n);
VERIFY( size<=50 || m.segment(50,size-50).sum() == Scalar(0) );
VERIFY_IS_APPROX(m.segment(0, 50), n);
VERIFY(size <= 50 || m.segment(50, size - 50).sum() == Scalar(0));
m = n = VectorType::Random(50);
m.conservativeResizeLike(Matrix<Scalar,Dynamic,Dynamic>::Zero(1,size));
VERIFY_IS_APPROX(m.segment(0,50), n);
VERIFY( size<=50 || m.segment(50,size-50).sum() == Scalar(0) );
m.conservativeResizeLike(Matrix<Scalar, Dynamic, Dynamic>::Zero(1, size));
VERIFY_IS_APPROX(m.segment(0, 50), n);
VERIFY(size <= 50 || m.segment(50, size - 50).sum() == Scalar(0));
}
}
// Basic memory leak check with a non-copyable scalar type
template<int> void noncopyable()
{
typedef Eigen::Matrix<AnnoyingScalar,Dynamic,1> VectorType;
typedef Eigen::Matrix<AnnoyingScalar,Dynamic,Dynamic> MatrixType;
template <int>
void noncopyable() {
typedef Eigen::Matrix<AnnoyingScalar, Dynamic, 1> VectorType;
typedef Eigen::Matrix<AnnoyingScalar, Dynamic, Dynamic> MatrixType;
{
#ifndef EIGEN_TEST_ANNOYING_SCALAR_DONT_THROW
@@ -122,24 +116,25 @@ template<int> void noncopyable()
#endif
int n = 50;
VectorType v0(n), v1(n);
MatrixType m0(n,n), m1(n,n), m2(n,n);
v0.setOnes(); v1.setOnes();
m0.setOnes(); m1.setOnes(); m2.setOnes();
VERIFY(m0==m1);
m0.conservativeResize(2*n,2*n);
VERIFY(m0.topLeftCorner(n,n) == m1);
MatrixType m0(n, n), m1(n, n), m2(n, n);
v0.setOnes();
v1.setOnes();
m0.setOnes();
m1.setOnes();
m2.setOnes();
VERIFY(m0 == m1);
m0.conservativeResize(2 * n, 2 * n);
VERIFY(m0.topLeftCorner(n, n) == m1);
VERIFY(v0.head(n) == v1);
v0.conservativeResize(2*n);
v0.conservativeResize(2 * n);
VERIFY(v0.head(n) == v1);
}
VERIFY(AnnoyingScalar::instances==0 && "global memory leak detected in noncopyable");
VERIFY(AnnoyingScalar::instances == 0 && "global memory leak detected in noncopyable");
}
EIGEN_DECLARE_TEST(conservative_resize)
{
for(int i=0; i<g_repeat; ++i)
{
EIGEN_DECLARE_TEST(conservative_resize) {
for (int i = 0; i < g_repeat; ++i) {
CALL_SUBTEST_1((run_matrix_tests<int, Eigen::RowMajor>()));
CALL_SUBTEST_1((run_matrix_tests<int, Eigen::ColMajor>()));
CALL_SUBTEST_2((run_matrix_tests<float, Eigen::RowMajor>()));
@@ -161,7 +156,7 @@ EIGEN_DECLARE_TEST(conservative_resize)
#ifndef EIGEN_TEST_ANNOYING_SCALAR_DONT_THROW
AnnoyingScalar::dont_throw = true;
#endif
CALL_SUBTEST_6(( run_vector_tests<AnnoyingScalar>() ));
CALL_SUBTEST_6(( noncopyable<0>() ));
CALL_SUBTEST_6((run_vector_tests<AnnoyingScalar>()));
CALL_SUBTEST_6((noncopyable<0>()));
}
}