GitHub-Proxy/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2025-04-23 18:19:34 +08:00
Code Issues Packages Projects Releases Wiki Activity

Check that minCoeff(int*)/maxCoeff(int*) always pick the first entry in case of multiple extrema.

Browse Source
This commit is contained in:
Gael Guennebaud 2013-01-05 23:49:47 +01:00
parent f9927b4aca
commit 8a50ed86f3
1 changed files with 12 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
test/visitor.cpp
View File

@ -97,6 +97,17 @@ template<typename VectorType> void vectorVisitor(const VectorType& w)
VERIFY_IS_APPROX(maxc, eigen_maxc); VERIFY_IS_APPROX(maxc, eigen_maxc);
VERIFY_IS_APPROX(minc, v.minCoeff()); VERIFY_IS_APPROX(minc, v.minCoeff());
VERIFY_IS_APPROX(maxc, v.maxCoeff()); VERIFY_IS_APPROX(maxc, v.maxCoeff());
Index idx0 = internal::random<Index>(0,size-1);
Index idx1 = eigen_minidx;
Index idx2 = eigen_maxidx;
VectorType v1(v), v2(v);
v1(idx0) = v1(idx1);
v2(idx0) = v2(idx2);
v1.minCoeff(&eigen_minidx);
v2.maxCoeff(&eigen_maxidx);
VERIFY(eigen_minidx == (std::min)(idx0,idx1));
VERIFY(eigen_maxidx == (std::min)(idx0,idx2));
} }
void test_visitor() void test_visitor()
@ -111,6 +122,7 @@ void test_visitor()
} }
for(int i = 0; i < g_repeat; i++) { for(int i = 0; i < g_repeat; i++) {
CALL_SUBTEST_7( vectorVisitor(Vector4f()) ); CALL_SUBTEST_7( vectorVisitor(Vector4f()) );
CALL_SUBTEST_7( vectorVisitor(Matrix<int,12,1>()) );
CALL_SUBTEST_8( vectorVisitor(VectorXd(10)) ); CALL_SUBTEST_8( vectorVisitor(VectorXd(10)) );
CALL_SUBTEST_9( vectorVisitor(RowVectorXd(10)) ); CALL_SUBTEST_9( vectorVisitor(RowVectorXd(10)) );
CALL_SUBTEST_10( vectorVisitor(VectorXf(33)) ); CALL_SUBTEST_10( vectorVisitor(VectorXf(33)) );