From 696b2f999f1fde11ad5dc49282e7450c693ba6db Mon Sep 17 00:00:00 2001
From: Jitse Niesen <jitse@maths.leeds.ac.uk>
Date: Sat, 28 Jul 2012 21:30:09 +0100
Subject: Eigenvalues module: Implement setMaxIterations() methods.

---
 test/schur_real.cpp | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)

(limited to 'test/schur_real.cpp')

diff --git a/test/schur_real.cpp b/test/schur_real.cpp
index e81a28d7d..36b9c24d1 100644
--- a/test/schur_real.cpp
+++ b/test/schur_real.cpp
@@ -68,18 +68,19 @@ template<typename MatrixType> void schur(int size = MatrixType::ColsAtCompileTim
 
   // Test maximum number of iterations
   RealSchur<MatrixType> rs3;
-  rs3.compute(A, true, RealSchur<MatrixType>::m_maxIterations * size);
+  rs3.setMaxIterations(RealSchur<MatrixType>::m_maxIterationsPerRow * size).compute(A);
   VERIFY_IS_EQUAL(rs3.info(), Success);
   VERIFY_IS_EQUAL(rs3.matrixT(), rs1.matrixT());
   VERIFY_IS_EQUAL(rs3.matrixU(), rs1.matrixU());
   if (size > 2) {
-    rs3.compute(A, true, 1);
+    rs3.setMaxIterations(1).compute(A);
     VERIFY_IS_EQUAL(rs3.info(), NoConvergence);
+    VERIFY_IS_EQUAL(rs3.getMaxIterations(), 1);
   }
 
   MatrixType Atriangular = A;
   Atriangular.template triangularView<StrictlyLower>().setZero(); 
-  rs3.compute(Atriangular, true, 1); // triangular matrices do not need any iterations
+  rs3.setMaxIterations(1).compute(Atriangular); // triangular matrices do not need any iterations
   VERIFY_IS_EQUAL(rs3.info(), Success);
   VERIFY_IS_EQUAL(rs3.matrixT(), Atriangular);
   VERIFY_IS_EQUAL(rs3.matrixU(), MatrixType::Identity(size, size));
-- 
cgit v1.2.3