aboutsummaryrefslogtreecommitdiffhomepage
path: root/test/visitor.cpp
diff options
context:
space:
mode:
authorGravatar Gael Guennebaud <g.gael@free.fr>2013-01-05 23:49:47 +0100
committerGravatar Gael Guennebaud <g.gael@free.fr>2013-01-05 23:49:47 +0100
commit8a50ed86f3016935b6495971f514db85a459e93b (patch)
treef302bac2bad60bf5333cff1af32ec1ccf1ac19f7 /test/visitor.cpp
parentf9927b4aca6e5402c81e71581b4720d5dbc58987 (diff)
Check that minCoeff(int*)/maxCoeff(int*) always pick the first entry in case of multiple extrema.
Diffstat (limited to 'test/visitor.cpp')
-rw-r--r--test/visitor.cpp12
1 files changed, 12 insertions, 0 deletions
diff --git a/test/visitor.cpp b/test/visitor.cpp
index 087306258..b771be73d 100644
--- a/test/visitor.cpp
+++ b/test/visitor.cpp
@@ -97,6 +97,17 @@ template<typename VectorType> void vectorVisitor(const VectorType& w)
VERIFY_IS_APPROX(maxc, eigen_maxc);
VERIFY_IS_APPROX(minc, v.minCoeff());
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()
@@ -111,6 +122,7 @@ void test_visitor()
}
for(int i = 0; i < g_repeat; i++) {
CALL_SUBTEST_7( vectorVisitor(Vector4f()) );
+ CALL_SUBTEST_7( vectorVisitor(Matrix<int,12,1>()) );
CALL_SUBTEST_8( vectorVisitor(VectorXd(10)) );
CALL_SUBTEST_9( vectorVisitor(RowVectorXd(10)) );
CALL_SUBTEST_10( vectorVisitor(VectorXf(33)) );