4445464748495051525354
} if(inverse) { fft.realInverse(array, false); } else { fft.realForwardFull(array); } return toComplex(array); } private static ComplexVector toComplex(double[] array) {
112113114115116117118119120121122
DoubleFFT_1D fft = CACHE_1D.get(n); if (fft == null) { fft = new DoubleFFT_1D(n); CACHE_1D.put(n, fft); } fft.realForwardFull(a); return unpackFull(a); } /** * The inverse (backward) discrete Fourier transform. *Note:* In this