comparison tests/TestFFT.cpp @ 476:2de6184b2ce0

Untabify

 
 BOOST_AUTO_TEST_SUITE(TestFFT)
 
 #define COMPARE_CONST(a, n) \
     for (int cmp_i = 0; cmp_i < (int)(sizeof(a)/sizeof(a[0])); ++cmp_i) { \
-        BOOST_CHECK_SMALL(a[cmp_i] - n, 1e-14);				\
+        BOOST_CHECK_SMALL(a[cmp_i] - n, 1e-14);                         \
     }
 
-#define COMPARE_ARRAY(a, b)						\
+#define COMPARE_ARRAY(a, b)                                             \
     for (int cmp_i = 0; cmp_i < (int)(sizeof(a)/sizeof(a[0])); ++cmp_i) { \
-        BOOST_CHECK_SMALL(a[cmp_i] - b[cmp_i], 1e-14);			\
+        BOOST_CHECK_SMALL(a[cmp_i] - b[cmp_i], 1e-14);                  \
     }
 
 //!!! need at least one test with complex time-domain signal
 
 BOOST_AUTO_TEST_CASE(forwardArrayBounds)

     double backim[4];
     FFT(4).process(true, re, im, back, backim);
     COMPARE_ARRAY(back, rin);
     COMPARE_ARRAY(backim, iin);
 }
-	
+        
 BOOST_AUTO_TEST_CASE(sineCosine)
 {
     // Sine and cosine mixed
     double in[] = { 0.5, 1, -0.5, -1 };
     double re[] = { 999, 999, 999, 999 };

     double backim[4];
     FFT(4).process(true, re, im, back, backim);
     COMPARE_ARRAY(back, in);
     COMPARE_CONST(backim, 0.0);
 }
-	
+        
 BOOST_AUTO_TEST_CASE(r_sineCosine)
 {
     // Sine and cosine mixed
     double in[] = { 0.5, 1, -0.5, -1 };
     double re[] = { 999, 999, 999, 999 };

     re[3] = 999;
     im[3] = 999;
     FFTReal(4).inverse(re, im, back);
     COMPARE_ARRAY(back, in);
 }
-	
+        
 BOOST_AUTO_TEST_CASE(c_sineCosine)
 {
     double rin[] = { 1, 0, -1, 0 };
     double iin[] = { 0, 1, 0, -1 };
     double re[] = { 999, 999, 999, 999 };