Fast Fourier transform: Difference between revisions

Content added Content deleted

Inline

@@ Line 360: / Line 360: @@
 D2 v2.060
-<lang D>import std.stdio, std.math, std.algorithm, std.range, std.complex, std.conv;
+<lang D>import std.stdio, std.math, std.algorithm, std.range, std.complex;
 auto fft(Complex!real[] x)
 {
-    int N = to!int(x.length);
+    ulong N = x.length;
     if (N <= 1) { return x; }
     auto ev = stride(x, 2).array.fft;