diff options
| author | Travis Oliphant <oliphant@enthought.com> | 2006-01-26 21:42:01 +0000 |
|---|---|---|
| committer | Travis Oliphant <oliphant@enthought.com> | 2006-01-26 21:42:01 +0000 |
| commit | f6d28d03b06dd15c9523a84047d6bec8b987b2d9 (patch) | |
| tree | 5b7f9f2354773006b16d39351829d63d94a3b7c5 /numpy/dft | |
| parent | 5da0b20fd90045f35b2b76e3ddff4f1c6c48908a (diff) | |
| download | numpy-f6d28d03b06dd15c9523a84047d6bec8b987b2d9.tar.gz | |
Simplify the ndenumerate class by exposing coords and index from flat iterator. Simple cosmetic changes to ffts.
Diffstat (limited to 'numpy/dft')
| -rw-r--r-- | numpy/dft/fftpack.py | 7 |
1 files changed, 3 insertions, 4 deletions
diff --git a/numpy/dft/fftpack.py b/numpy/dft/fftpack.py index 441aae5f5..05efc759c 100644 --- a/numpy/dft/fftpack.py +++ b/numpy/dft/fftpack.py @@ -108,7 +108,7 @@ def inverse_fft(a, n=None, axis=-1): run into memory problems if you call this too many times with too many different n's.""" - a = asarray(a).astype(Complex) + a = asarray(a).astype(complex) if n == None: n = shape(a)[axis] return _raw_fft(a, n, axis, fftpack.cffti, fftpack.cfftb, _fft_cache) / n @@ -131,7 +131,7 @@ def real_fft(a, n=None, axis=-1): This is most efficient for n a power of two.""" - a = asarray(a).astype(Float) + a = asarray(a).astype(float) return _raw_fft(a, n, axis, fftpack.rffti, fftpack.rfftf, _real_fft_cache) @@ -153,7 +153,7 @@ def inverse_real_fft(a, n=None, axis=-1): inverse_real_fft(real_fft(a), len(a)) == a within numerical accuracy.""" - a = asarray(a).astype(Complex) + a = asarray(a).astype(complex) if n == None: n = (shape(a)[axis] - 1) * 2 return _raw_fft(a, n, axis, fftpack.rffti, fftpack.rfftb, @@ -283,7 +283,6 @@ def real_fftnd(a, s=None, axes=None): a = fft(a, s[ii], axes[ii]) return a - def real_fft2d(a, s=None, axes=(-2,-1)): """real_fft2d(a, s=None, axes=(-2,-1)) |