contiguous-fft 0.2.0.0 → 0.2.1.0

raw patch · 3 files changed

+12/−3 lines, 3 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• ChangeLog.md +7/−1
• contiguous-fft.cabal +1/−1
• src/Data/Primitive/Contiguous/FFT.hs +4/−1

@@ -1,5 +1,11 @@ # Revision history for contiguous-fft -## 0.1.0.0 -- YYYY-mm-dd+## 0.2.1.0 -- 2019-02-15+* Expose 'mfft'. +## 0.2.0.0 -- 2019-02-15+* Simplified API to just 'fft' and 'ifft'.+* Switch to a much more efficient implementation of computing the FFT.++## 0.1.0.0 -- YYYY-mm-dd * First version. Released on an unsuspecting world.

@@ -1,5 +1,5 @@ name:                contiguous-fft-version:             0.2.0.0+version:             0.2.1.0 synopsis:            dft of contiguous memory structures description:         DFT and iDFT on data structures implementing a common                      contiguous interface

@@ -9,6 +9,7 @@ module Data.Primitive.Contiguous.FFT   ( fft   , ifft+  , mfft   ) where  import qualified Prelude@@ -76,7 +77,9 @@   let n = Contiguous.size arr   in (1 `shiftL` log2 n) == n  --- array length must be power of two. This property is not checked +-- | Radix-2 decimation-in-time fast Fourier Transform.+--   The given array must have a length that is a power of two,+--   though this property is not checked. mfft :: forall arr s. (Contiguous arr, Element arr (Complex Double))   => Mutable arr s (Complex Double)   -> ST s ()