v0.1.0

Initial Release.

Added

• a O ( n 2 ) DFT implementation which works on arbitrary sized arrays
• a Type for holding a FFT-Plan (FFTPlan)
• a plan_fft function that plans the FFT for a known length
  • supporting Decimation-in-Frequency (method=:dif) and Decimation-in-Time (method=:dit)
  • supporting the Min-Radix planning style (rad=:min)
• a Cooley-Tukey FFT implementation for applying such plans to an array
• base-cases for arrays of sizes [1,2,4] to further improve execution speed
• public interface functions: fft,ifft,plan_fft; as well as fft_cooley_tukey and dft.

~hv10

Full Changelog: https://github.com/hv10/PureFFT.jl/commits/v0.1.0