diff tests/TestResampler.cpp @ 476:2de6184b2ce0

Untabify

--- a/tests/TestResampler.cpp	Thu May 30 18:28:11 2019 +0100
+++ b/tests/TestResampler.cpp	Thu May 30 18:30:58 2019 +0100
@@ -22,30 +22,30 @@
 
 void
 testResamplerOneShot(int sourceRate,
-		     int targetRate,
-		     int n,
-		     double *in,
-		     int m,
-		     double *expected,
-		     int skip)
+                     int targetRate,
+                     int n,
+                     double *in,
+                     int m,
+                     double *expected,
+                     int skip)
 {
     vector<double> resampled = Resampler::resample(sourceRate, targetRate,
-						   in, n);
+                                                   in, n);
     if (skip == 0) {
-	BOOST_CHECK_EQUAL(resampled.size(), m);
+        BOOST_CHECK_EQUAL(resampled.size(), m);
     }
     for (int i = 0; i < m; ++i) {
-	BOOST_CHECK_SMALL(resampled[i + skip] - expected[i], 1e-6);
+        BOOST_CHECK_SMALL(resampled[i + skip] - expected[i], 1e-6);
     }
 }
 
 void
 testResampler(int sourceRate,
-	      int targetRate,
-	      int n,
-	      double *in,
-	      int m,
-	      double *expected)
+              int targetRate,
+              int n,
+              double *in,
+              int m,
+              double *expected)
 {
     // Here we provide the input in chunks (of varying size)
 
@@ -59,12 +59,12 @@
     double *outPadded = new double[m1];
 
     for (int i = 0; i < n1; ++i) {
-	if (i < n) inPadded[i] = in[i];
-	else inPadded[i] = 0.0;
+        if (i < n) inPadded[i] = in[i];
+        else inPadded[i] = 0.0;
     }
     
     for (int i = 0; i < m1; ++i) {
-	outPadded[i] = -999.0;
+        outPadded[i] = -999.0;
     }
 
     int chunkSize = 1;
@@ -72,22 +72,22 @@
     int i = 0;
 
     while (true) {
-	got += r.process(inPadded + i, outPadded + got, chunkSize);
-	i = i + chunkSize;
-	chunkSize = chunkSize + 1;
-	if (i >= n1) {
-	    break;
-	} else if (i + chunkSize >= n1) {
-	    chunkSize = n1 - i;
-	} else if (chunkSize > 15) {
-	    chunkSize = 1;
-	}
+        got += r.process(inPadded + i, outPadded + got, chunkSize);
+        i = i + chunkSize;
+        chunkSize = chunkSize + 1;
+        if (i >= n1) {
+            break;
+        } else if (i + chunkSize >= n1) {
+            chunkSize = n1 - i;
+        } else if (chunkSize > 15) {
+            chunkSize = 1;
+        }
     }
 
     BOOST_CHECK_EQUAL(got, m1);
 
     for (int i = latency; i < m1; ++i) {
-	BOOST_CHECK_SMALL(outPadded[i] - expected[i-latency], 1e-8);
+        BOOST_CHECK_SMALL(outPadded[i] - expected[i-latency], 1e-8);
     }
 
     delete[] outPadded;
@@ -113,10 +113,10 @@
     double in[] = { 0, 0.1, -0.3, -0.4, -0.3, 0, 0.5, 0.2, 0.8, -0.1 };
     int n = sizeof(in)/sizeof(in[0]);
     for (int factor = 2; factor < 10; ++factor) {
-	vector<double> out = Resampler::resample(6, 6 * factor, in, n);
-	for (int i = 0; i < n; ++i) {
-	    BOOST_CHECK_SMALL(out[i * factor] - in[i], 1e-5);
-	}
+        vector<double> out = Resampler::resample(6, 6 * factor, in, n);
+        for (int i = 0; i < n; ++i) {
+            BOOST_CHECK_SMALL(out[i * factor] - in[i], 1e-5);
+        }
     }
 }
 
@@ -127,10 +127,10 @@
     double in[1000];
     double out[2000];
     for (int i = 0; i < 1000; ++i) {
-	in[i] = sin(i * M_PI / 2.0);
+        in[i] = sin(i * M_PI / 2.0);
     }
     for (int i = 0; i < 2000; ++i) {
-	out[i] = sin(i * M_PI / 4.0);
+        out[i] = sin(i * M_PI / 4.0);
     }
     testResamplerOneShot(8, 16, 1000, in, 200, out, 512);
 }
@@ -142,10 +142,10 @@
     double in[2000];
     double out[1000];
     for (int i = 0; i < 2000; ++i) {
-	in[i] = sin(i * M_PI / 8.0);
+        in[i] = sin(i * M_PI / 8.0);
     }
     for (int i = 0; i < 1000; ++i) {
-	out[i] = sin(i * M_PI / 4.0);
+        out[i] = sin(i * M_PI / 4.0);
     }
     testResamplerOneShot(16, 8, 2000, in, 200, out, 256);
 }
@@ -251,12 +251,12 @@
     //!!! todo: hoist, test
     vector<double> v(n, 0.0);
     for (int h = 0; h < (rate/4)/freq; ++h) {
-	double m = h * 2 + 1;
-	double scale = 1.0 / m;
-	for (int i = 0; i < n; ++i) {
-	    double s = scale * sin((i * 2.0 * M_PI * m * freq) / rate);
-	    v[i] += s;
-	}
+        double m = h * 2 + 1;
+        double scale = 1.0 / m;
+        for (int i = 0; i < n; ++i) {
+            double s = scale * sin((i * 2.0 * M_PI * m * freq) / rate);
+            v[i] += s;
+        }
     }
     return v;
 }
@@ -268,10 +268,10 @@
     int freq = 500;
 
     vector<double> square =
-	squareWave(inrate, freq, inrate);
+        squareWave(inrate, freq, inrate);
 
     vector<double> maybeSquare = 
-	Resampler::resample(inrate, outrate, square.data(), square.size());
+        Resampler::resample(inrate, outrate, square.data(), square.size());
 
     BOOST_CHECK_EQUAL(maybeSquare.size(), outrate);
 
@@ -283,13 +283,13 @@
     vector<double> inSpectrum(inrate, 0.0);
     FFTReal(inrate).forwardMagnitude(square.data(), inSpectrum.data());
     for (int i = 0; i < (int)inSpectrum.size(); ++i) {
-	inSpectrum[i] /= inrate;
+        inSpectrum[i] /= inrate;
     }
 
     vector<double> outSpectrum(outrate, 0.0);
     FFTReal(outrate).forwardMagnitude(maybeSquare.data(), outSpectrum.data());
     for (int i = 0; i < (int)outSpectrum.size(); ++i) {
-	outSpectrum[i] /= outrate;
+        outSpectrum[i] /= outrate;
     }
 
     // Don't compare bins any higher than 96% of Nyquist freq of lower sr
@@ -297,7 +297,7 @@
     lengthOfInterest = lengthOfInterest - (lengthOfInterest / 25);
 
     for (int i = 0; i < lengthOfInterest; ++i) {
-	BOOST_CHECK_SMALL(inSpectrum[i] - outSpectrum[i], 1e-7);
+        BOOST_CHECK_SMALL(inSpectrum[i] - outSpectrum[i], 1e-7);
     }
 }
 /*
@@ -305,9 +305,9 @@
 {
     int rates[] = { 8000, 22050, 44100, 48000 };
     for (int i = 0; i < (int)(sizeof(rates)/sizeof(rates[0])); ++i) {
-	    for (int j = 0; j < (int)(sizeof(rates)/sizeof(rates[0])); ++j) {
-	    testSpectrum(rates[i], rates[j]);
-	}
+            for (int j = 0; j < (int)(sizeof(rates)/sizeof(rates[0])); ++j) {
+            testSpectrum(rates[i], rates[j]);
+        }
     }
 }
 */