Working pow2

Author: dannys4

Project.toml

@@ -5,6 +5,7 @@ version = "0.1.0"
 
 [deps]
 Primes = "27ebfcd6-29c5-5fa9-bf4b-fb8fc14df3ae"
+StaticArrays = "90137ffa-7385-5640-81b9-e52037218182"
 
 [compat]
 julia = "1"

src/NSFFT.jl

@@ -1,6 +1,6 @@
 module NSFFT
 
-using Primes
+using Primes, StaticArrays
 export pow2FFT!, myfft_sv
 
 include("algos.jl")

src/algos.jl

@@ -1,7 +1,7 @@
 @enum Direction FFT_FORWARD FFT_BACKWARD
 
-function pow2FFT!(out::AbstractArray{T,0}, in::AbstractArray{T,0}, ::Val) where T
-    out[] = in[]
+function pow2FFT!(out::AbstractArray{T,0}, in::AbstractArray{T,1}, ::Val) where T
+    out[] = in[1]
 end
 
 function pow2FFT!(out::AbstractVector{T}, in::AbstractVector{T}, ::Val{FFT_FORWARD}) where {T<:Complex}
@@ -10,33 +10,17 @@ function pow2FFT!(out::AbstractVector{T}, in::AbstractVector{T}, ::Val{FFT_FORWA
         out[1] = in[1]
         return
     end
-    pow2FFT!(@view(out[1:2:end]), @view(in[1:2:end]), Val(FFT_FORWARD))
-    pow2FFT!(@view(out[2:2:end]), @view(in[2:2:end]), Val(FFT_FORWARD))
+    pow2FFT!(@view(out[1:(end÷2)]), @view(in[1:2:end]), Val(FFT_FORWARD))
+    pow2FFT!(@view(out[(end÷2+1):end]), @view(in[2:2:end]), Val(FFT_FORWARD))
 
     inc = 2*π/N
     w1 = T(cos(inc), -sin(inc));
     wj = T(1,0)
     m = N ÷ 2
     for j in 1:m
         out_j    = out[j]
-        println(out_j)
         out[j]   = out_j + wj*out[j+m]
-        println(out_j)
-        println()
         out[j+m] = out_j - wj*out[j+m]
         wj *= w1
     end
-    println()
-end
-
-even_zeroindexed_sv(x::SVector{N,T}) where {N,T} = SVector{N÷2}(x[1:2:end])
-
-function myfft_sv(arr::SVector{N, T}) where {N, T<:Complex}
-    Nhalf = N/2
-    ft_even =  myfft_sv(even_zeroindexed_sv(arr))
-    ft_odd =  myfft_sv(odd_zeroindexed_sv(arr))
-    f(e, o, n) = e + exp(-2im * T(π*n/N)) * o
-    ft_first = map(f, ft_even, ft_odd, 0:Nhalf-1)
-    ft_second = map(f, ft_even, ft_odd, Nhalf:N-1)
-    vcat(ft_first, ft_second)
 end