Mercurial > hg > qm-dsp

diff tests/TestDCT.cpp @ 505:930b5b0f707d

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Merge branch 'codestyle-and-tidy'
author Chris Cannam <cannam@all-day-breakfast.com>
date Wed, 05 Jun 2019 12:55:15 +0100
parents 2de6184b2ce0
children
line wrap: on
line diff
--- a/tests/TestDCT.cpp	Thu May 30 16:18:13 2019 +0100
+++ b/tests/TestDCT.cpp	Wed Jun 05 12:55:15 2019 +0100
@@ -106,13 +106,13 @@
     d.forward(in.data(), out.data());
     
     for (int i = 0; i < n; ++i) {
-	BOOST_CHECK_SMALL(expected[i] - out[i], thresh);
+        BOOST_CHECK_SMALL(expected[i] - out[i], thresh);
     }
 
     d.inverse(out.data(), inv.data());
 
     for (int i = 0; i < n; ++i) {
-	BOOST_CHECK_SMALL(in[i] - inv[i], thresh);
+        BOOST_CHECK_SMALL(in[i] - inv[i], thresh);
     }
     
     // do it again, just in case some internal state was modified in inverse
@@ -120,7 +120,7 @@
     d.forward(in.data(), out.data());
     
     for (int i = 0; i < n; ++i) {
-	BOOST_CHECK_SMALL(expected[i] - out[i], thresh);
+        BOOST_CHECK_SMALL(expected[i] - out[i], thresh);
     }
 }
 
@@ -140,13 +140,13 @@
     d.forwardUnitary(in.data(), out.data());
     
     for (int i = 0; i < n; ++i) {
-	BOOST_CHECK_SMALL(expected[i] - out[i], thresh);
+        BOOST_CHECK_SMALL(expected[i] - out[i], thresh);
     }
 
     d.inverseUnitary(out.data(), inv.data());
 
     for (int i = 0; i < n; ++i) {
-	BOOST_CHECK_SMALL(in[i] - inv[i], thresh);
+        BOOST_CHECK_SMALL(in[i] - inv[i], thresh);
     }
     
     // do it again, just in case some internal state was modified in inverse
@@ -154,7 +154,7 @@
     d.forwardUnitary(in.data(), out.data());
     
     for (int i = 0; i < n; ++i) {
-	BOOST_CHECK_SMALL(expected[i] - out[i], thresh);
+        BOOST_CHECK_SMALL(expected[i] - out[i], thresh);
     }
 }
 
@@ -174,13 +174,13 @@
     d.forwardUnitary(in.data(), out.data());
     
     for (int i = 0; i < n; ++i) {
-	BOOST_CHECK_SMALL(expected[i] - out[i], thresh);
+        BOOST_CHECK_SMALL(expected[i] - out[i], thresh);
     }
 
     d.inverseUnitary(out.data(), inv.data());
 
     for (int i = 0; i < n; ++i) {
-	BOOST_CHECK_SMALL(in[i] - inv[i], thresh);
+        BOOST_CHECK_SMALL(in[i] - inv[i], thresh);
     }
     
     // do it again, just in case some internal state was modified in inverse
@@ -188,7 +188,7 @@
     d.forwardUnitary(in.data(), out.data());
     
     for (int i = 0; i < n; ++i) {
-	BOOST_CHECK_SMALL(expected[i] - out[i], thresh);
+        BOOST_CHECK_SMALL(expected[i] - out[i], thresh);
     }
 }