aboutsummaryrefslogtreecommitdiffhomepage
path: root/test
diff options
context:
space:
mode:
authorGravatar Gael Guennebaud <g.gael@free.fr>2015-06-22 09:58:06 +0200
committerGravatar Gael Guennebaud <g.gael@free.fr>2015-06-22 09:58:06 +0200
commitb3b3dcad0548d3d0842c7089625a8eb84f2ab478 (patch)
tree0d1722c2bdd6bb0498f1025a54474bce3c95f464 /test
parent40821876eacd2f3ba53da1085dacd2f47f58fbca (diff)
Reduce compiler memory consumption for SVD unit tests
Diffstat (limited to 'test')
-rw-r--r--test/bdcsvd.cpp4
-rw-r--r--test/jacobisvd.cpp4
-rw-r--r--test/svd_common.h2
3 files changed, 6 insertions, 4 deletions
diff --git a/test/bdcsvd.cpp b/test/bdcsvd.cpp
index 52a02b697..c77b7c519 100644
--- a/test/bdcsvd.cpp
+++ b/test/bdcsvd.cpp
@@ -104,8 +104,8 @@ void test_bdcsvd()
CALL_SUBTEST_7( BDCSVD<MatrixXf>(10,10) );
// Check that preallocation avoids subsequent mallocs
- CALL_SUBTEST_9( svd_preallocate() );
+ CALL_SUBTEST_9( svd_preallocate<void>() );
- CALL_SUBTEST_2( svd_underoverflow() );
+ CALL_SUBTEST_2( svd_underoverflow<void>() );
}
diff --git a/test/jacobisvd.cpp b/test/jacobisvd.cpp
index f9de6b708..3d8d0203d 100644
--- a/test/jacobisvd.cpp
+++ b/test/jacobisvd.cpp
@@ -114,7 +114,7 @@ void test_jacobisvd()
CALL_SUBTEST_7( JacobiSVD<MatrixXf>(10,10) );
// Check that preallocation avoids subsequent mallocs
- CALL_SUBTEST_9( svd_preallocate() );
+ CALL_SUBTEST_9( svd_preallocate<void>() );
- CALL_SUBTEST_2( svd_underoverflow() );
+ CALL_SUBTEST_2( svd_underoverflow<void>() );
}
diff --git a/test/svd_common.h b/test/svd_common.h
index b06a8a0f2..e300336c6 100644
--- a/test/svd_common.h
+++ b/test/svd_common.h
@@ -307,6 +307,7 @@ void svd_inf_nan()
// Regression test for bug 286: JacobiSVD loops indefinitely with some
// matrices containing denormal numbers.
+template<typename>
void svd_underoverflow()
{
#if defined __INTEL_COMPILER
@@ -384,6 +385,7 @@ void svd_all_trivial_2x2( void (*cb)(const MatrixType&,bool) )
} while((id<int(value_set.size())).all());
}
+template<typename>
void svd_preallocate()
{
Vector3f v(3.f, 2.f, 1.f);