Convert to FFTA

Author: dannys4

README.md

@@ -1,4 +1,4 @@
-# NSFFT
+# FFTA: Fastest Fourier Transform in my Apartment
 ## A library by Danny Sharp
 
 This is a *pure Julia* implementation of FFTs, with the goal that this could supplant other FFTs for applications that require odd Julia objects. Currently this supports `AbstractArray{T,N}` for `T<:Complex` and `N` in `{1,2}` (i.e. `AbstractVector` and `AbstractMatrix`). If you're looking for more performance, checkout `FFTW.jl`.

src/NSFFT.jl renamed to src/FFTA.jl

@@ -1,4 +1,4 @@
-module NSFFT
+module FFTA
 
 using Primes, DocStringExtensions
 import Base: getindex

test/testNSFFT.jl renamed to test/ffta.jl

@@ -1,8 +1,8 @@
-using NSFFT
+using FFTA
 
 for N in [8, 11, 15, 100]
     x = zeros(ComplexF64, N)
     x[1] = 1
-    y = NSFFT.fft(x)
+    y = fft(x)
     @test y ≈ ones(size(x))
 end

test/runtests.jl

@@ -1,5 +1,5 @@
 using Test
 
 @testset verbose = true "Unit Tests" begin
-    include("testNSFFT.jl")
+    include("ffta.jl")
 end