[Scipy-svn] r4324 - branches/refactor_fft/scipy/fftpack/src

[scipy-svn at scipy.org]

Author: cdavid
Date: 2008-05-13 04:54:17 -0500 (Tue, 13 May 2008)
New Revision: 4324

Modified:
   branches/refactor_fft/scipy/fftpack/src/zrfft.c
Log:
Forgot to remove tab.

Modified: branches/refactor_fft/scipy/fftpack/src/zrfft.c
===================================================================
--- branches/refactor_fft/scipy/fftpack/src/zrfft.c	2008-05-13 09:50:58 UTC (rev 4323)
+++ branches/refactor_fft/scipy/fftpack/src/zrfft.c	2008-05-13 09:54:17 UTC (rev 4324)
@@ -7,50 +7,50 @@
 #include "fftpack.h"
 
 extern void drfft(double *inout, int n, int direction, int howmany,
-		  int normalize);
+                  int normalize);
 
 extern void zrfft(complex_double * inout, int n, int direction,
-		  int howmany, int normalize)
+                  int howmany, int normalize)
 {
     int i, j, k;
     double *ptr = (double *) inout;
     switch (direction) {
     case 1:
-	for (i = 0; i < howmany; ++i, ptr += 2 * n) {
-	    *(ptr + 1) = *ptr;
-	    for (j = 2, k = 3; j < n; ++j, ++k)
-		*(ptr + k) = *(ptr + 2 * j);
-	    drfft(ptr + 1, n, 1, 1, normalize);
-	    *ptr = *(ptr + 1);
-	    *(ptr + 1) = 0.0;
-	    if (!(n % 2))
-		*(ptr + n + 1) = 0.0;
-	    for (j = 2, k = 2 * n - 2; j < n; j += 2, k -= 2) {
-		*(ptr + k) = *(ptr + j);
-		*(ptr + k + 1) = -(*(ptr + j + 1));
-	    }
-	}
-	break;
+        for (i = 0; i < howmany; ++i, ptr += 2 * n) {
+            *(ptr + 1) = *ptr;
+            for (j = 2, k = 3; j < n; ++j, ++k)
+                *(ptr + k) = *(ptr + 2 * j);
+            drfft(ptr + 1, n, 1, 1, normalize);
+            *ptr = *(ptr + 1);
+            *(ptr + 1) = 0.0;
+            if (!(n % 2))
+                *(ptr + n + 1) = 0.0;
+            for (j = 2, k = 2 * n - 2; j < n; j += 2, k -= 2) {
+                *(ptr + k) = *(ptr + j);
+                *(ptr + k + 1) = -(*(ptr + j + 1));
+            }
+        }
+        break;
     case -1:
-	for (i = 0; i < howmany; ++i, ptr += 2 * n) {
-	    *(ptr + 1) = (*ptr);
-	    for (j = 1, k = 2; j < n; ++j, ++k)
-		*(ptr + k) = (*(ptr + 2 * j));
-	    drfft(ptr + 1, n, 1, 1, normalize);
-	    *ptr = *(ptr + 1);
-	    *(ptr + 1) = 0.0;
-	    if (!(n % 2))
-		*(ptr + n + 1) = 0.0;
-	    for (j = 2, k = 2 * n - 2; j < n; j += 2, k -= 2) {
-		double d;
-		*(ptr + k) = *(ptr + j);
-		d = *(ptr + j + 1);
-		*(ptr + k + 1) = d;
-		*(ptr + j + 1) = -d;
-	    }
-	}
-	break;
+        for (i = 0; i < howmany; ++i, ptr += 2 * n) {
+            *(ptr + 1) = (*ptr);
+            for (j = 1, k = 2; j < n; ++j, ++k)
+                *(ptr + k) = (*(ptr + 2 * j));
+            drfft(ptr + 1, n, 1, 1, normalize);
+            *ptr = *(ptr + 1);
+            *(ptr + 1) = 0.0;
+            if (!(n % 2))
+                *(ptr + n + 1) = 0.0;
+            for (j = 2, k = 2 * n - 2; j < n; j += 2, k -= 2) {
+                double d;
+                *(ptr + k) = *(ptr + j);
+                d = *(ptr + j + 1);
+                *(ptr + k + 1) = d;
+                *(ptr + j + 1) = -d;
+            }
+        }
+        break;
     default:
-	fprintf(stderr, "zrfft: invalid direction=%d\n", direction);
+        fprintf(stderr, "zrfft: invalid direction=%d\n", direction);
     }
 }