using works in 0.7

Author: dlfivefifty

src/FastTransforms.jl

@@ -1,14 +1,19 @@
 __precompile__()
 module FastTransforms
 
-using Base, ToeplitzMatrices, HierarchicalMatrices, LowRankApprox, ProgressMeter, Compat
+using ToeplitzMatrices, HierarchicalMatrices, LowRankApprox, ProgressMeter, Compat,
+        FFTW, AbstractFFTs
 
 import Base: *, \, size, view
 import Base: getindex, setindex!, Factorization, length
 import Base.LinAlg: BlasFloat, BlasInt
 import HierarchicalMatrices: HierarchicalMatrix, unsafe_broadcasttimes!
 import HierarchicalMatrices: A_mul_B!, At_mul_B!, Ac_mul_B!
 import LowRankApprox: ColPerm
+import AbstractFFTs: Plan
+import FFTW: r2rFFTWPlan, unsafe_execute!, fftwSingle, fftwDouble, fftwNumber
+import FFTW: libfftw, libfftwf, PlanPtr, r2rFFTWPlan
+
 
 export cjt, icjt, jjt, plan_cjt, plan_icjt
 export leg2cheb, cheb2leg, leg2chebu, ultra2ultra, jac2jac

src/SphericalHarmonics/synthesisanalysis.jl

@@ -5,7 +5,7 @@ immutable SynthesisPlan{T, P1, P2}
     temp::Vector{T}
 end
 
-function plan_synthesis{T<:FFTW.fftwNumber}(A::Matrix{T})
+function plan_synthesis{T<:fftwNumber}(A::Matrix{T})
     m, n = size(A)
     x = FFTW.FakeArray(T, m)
     y = FFTW.FakeArray(T, n)
@@ -22,7 +22,7 @@ immutable AnalysisPlan{T, P1, P2}
     temp::Vector{T}
 end
 
-function plan_analysis{T<:FFTW.fftwNumber}(A::Matrix{T})
+function plan_analysis{T<:fftwNumber}(A::Matrix{T})
     m, n = size(A)
     x = FFTW.FakeArray(T, m)
     y = FFTW.FakeArray(T, n)
@@ -171,9 +171,6 @@ function negateeven!(x::Vector)
     x
 end
 
-import Base.FFTW: unsafe_execute!, fftwSingle, fftwDouble, fftwNumber
-import Base.FFTW: libfftw, libfftwf, PlanPtr, r2rFFTWPlan
-
 function A_mul_B_col_J!{T}(Y::Matrix{T}, P::r2rFFTWPlan{T}, X::Matrix{T}, J::Int)
     unsafe_execute_col_J!(P, X, Y, J)
     return Y

src/fftBigFloat.jl

@@ -128,12 +128,12 @@ Base.dct!{T<:BigFloats}(a::AbstractArray{T}) = (b = dct(a); a[:] = b)
 Base.idct!{T<:BigFloats}(a::AbstractArray{T}) = (b = idct(a); a[:] = b)
 
 # dummy plans
-type DummyFFTPlan{T,inplace} <: Base.DFT.Plan{T} end
-type DummyiFFTPlan{T,inplace} <: Base.DFT.Plan{T} end
-type DummyrFFTPlan{T,inplace} <: Base.DFT.Plan{T} end
-type DummyirFFTPlan{T,inplace} <: Base.DFT.Plan{T} end
-type DummyDCTPlan{T,inplace} <: Base.DFT.Plan{T} end
-type DummyiDCTPlan{T,inplace} <: Base.DFT.Plan{T} end
+type DummyFFTPlan{T,inplace} <: Plan{T} end
+type DummyiFFTPlan{T,inplace} <: Plan{T} end
+type DummyrFFTPlan{T,inplace} <: Plan{T} end
+type DummyirFFTPlan{T,inplace} <: Plan{T} end
+type DummyDCTPlan{T,inplace} <: Plan{T} end
+type DummyiDCTPlan{T,inplace} <: Plan{T} end
 
 for (Plan,iPlan) in ((:DummyFFTPlan,:DummyiFFTPlan),
                      (:DummyrFFTPlan,:DummyirFFTPlan),

src/inufft.jl

@@ -3,7 +3,7 @@ Pre-computes an inverse nonuniform fast Fourier transform of type `N`.
 
 For best performance, choose the right number of threads by `FFTW.set_num_threads(4)`, for example.
 """
-immutable iNUFFTPlan{N,T,S,PT} <: Base.DFT.Plan{T}
+immutable iNUFFTPlan{N,T,S,PT} <: Plan{T}
     pt::PT
     TP::Toeplitz{T}
     r::Vector{T}

src/nufft.jl

@@ -3,7 +3,7 @@ Pre-computes a nonuniform fast Fourier transform of type `N`.
 
 For best performance, choose the right number of threads by `FFTW.set_num_threads(4)`, for example.
 """
-immutable NUFFTPlan{N,T,FFT} <: Base.DFT.Plan{T}
+immutable NUFFTPlan{N,T,FFT} <: Plan{T}
     U::Matrix{T}
     V::Matrix{T}
     p::FFT
@@ -234,7 +234,7 @@ Pre-computes a 2D nonuniform fast Fourier transform.
 
 For best performance, choose the right number of threads by `FFTW.set_num_threads(4)`, for example.
 """
-immutable NUFFT2DPlan{T,P1,P2} <: Base.DFT.Plan{T}
+immutable NUFFT2DPlan{T,P1,P2} <: Plan{T}
     p1::P1
     p2::P2
     temp::Vector{T}