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

Reduce compiler memory consumption for SVD unit tests

Browse Source
This commit is contained in:
Gael Guennebaud
2015-06-22 09:58:06 +02:00
parent 40821876ea
commit b3b3dcad05
3 changed files with 6 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
test/bdcsvd.cpp
View File

@@ -104,8 +104,8 @@ void test_bdcsvd()
CALL_SUBTEST_7( BDCSVD<MatrixXf>(10,10) ); CALL_SUBTEST_7( BDCSVD<MatrixXf>(10,10) );
// Check that preallocation avoids subsequent mallocs // 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>() );
} }

4
test/jacobisvd.cpp
View File

@@ -114,7 +114,7 @@ void test_jacobisvd()
CALL_SUBTEST_7( JacobiSVD<MatrixXf>(10,10) ); CALL_SUBTEST_7( JacobiSVD<MatrixXf>(10,10) );
// Check that preallocation avoids subsequent mallocs // 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>() );
} }

2
test/svd_common.h
View File

@@ -307,6 +307,7 @@ void svd_inf_nan()
// Regression test for bug 286: JacobiSVD loops indefinitely with some // Regression test for bug 286: JacobiSVD loops indefinitely with some
// matrices containing denormal numbers. // matrices containing denormal numbers.
template<typename>
void svd_underoverflow() void svd_underoverflow()
{ {
#if defined __INTEL_COMPILER #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()); } while((id<int(value_set.size())).all());
} }
template<typename>
void svd_preallocate() void svd_preallocate()
{ {
Vector3f v(3.f, 2.f, 1.f); Vector3f v(3.f, 2.f, 1.f);