0.5 and 0.6 pass tests without errors/warnings!

Author: dlfivefifty

.travis.yml

@@ -4,7 +4,6 @@ os:
   - linux
   - osx
 julia:
-  - 0.4
   - 0.5
   - nightly
 notifications:

src/PaduaTransform.jl

@@ -194,7 +194,7 @@ Returns coordinates of the (n+1)(n+2)/2 Padua points.
 """
 function paduapoints{T}(::Type{T},n::Integer)
     N=div((n+1)*(n+2),2)
-    MM=Array(T,N,2)
+    MM=Matrix{T}(N,2)
     m=0
     delta=0
     NN=fld(n+2,2)

src/fftBigFloat.jl

@@ -104,7 +104,8 @@ end
 function Base.dct(a::AbstractArray{Complex{BigFloat}})
 	N = big(length(a))
     c = fft([a; flipdim(a,1)])
-    d = c[1:N] .* exp(-im*big(pi)*(0:N-1)/(2*N))
+    d = c[1:N]
+    d .*= exp.((-im*big(pi)).*(0:N-1)./(2*N))
     d[1] = d[1] / sqrt(big(2))
     scale!(inv(sqrt(2N)), d)
 end
@@ -115,7 +116,7 @@ function Base.idct(a::AbstractArray{Complex{BigFloat}})
     N = big(length(a))
     b = a * sqrt(2*N)
     b[1] = b[1] * sqrt(big(2))
-    b = b .* exp(im*big(pi)*(0:N-1)/(2*N))
+    b .*= exp.((im*big(pi)).*(0:N-1)./(2*N))
     b = [b; 0; conj(flipdim(b[2:end],1))]
     c = ifft(b)
     c[1:N]
@@ -151,8 +152,8 @@ for (Plan,ff,ff!) in ((:DummyFFTPlan,:fft,:fft!),
                       (:DummyDCTPlan,:dct,:dct!),
                       (:DummyiDCTPlan,:idct,:idct!))
     @eval begin
-        *{T,N}(p::$Plan{T,true}, x::StridedArray{T,N})=$ff!(x)
-        *{T,N}(p::$Plan{T,false}, x::StridedArray{T,N})=$ff(x)
+        *{T,N}(p::$Plan{T,true}, x::StridedArray{T,N}) = $ff!(x)
+        *{T,N}(p::$Plan{T,false}, x::StridedArray{T,N}) = $ff(x)
         function Base.A_mul_B!(C::StridedVector,p::$Plan,x::StridedVector)
             C[:]=$ff(x)
             C

src/toeplitzhankel.jl

@@ -34,7 +34,7 @@ function partialchol(H::Hankel)
     v=[H[:,1];vec(H[end,2:end])]
     d=diag(H)
     @assert length(v) ≥ 2n-1
-    reltol=maxabs(d)*eps(eltype(H))*log(n)
+    reltol=maximum(abs,d)*eps(eltype(H))*log(n)
     for k=1:n
         mx,idx=findmax(d)
         if mx ≤ reltol break end
@@ -61,7 +61,7 @@ function partialchol(H::Hankel,D::AbstractVector)
     v=[H[:,1];vec(H[end,2:end])]
     d=diag(H).*D.^2
     @assert length(v) ≥ 2n-1
-    reltol=maxabs(d)*eps(T)*log(n)
+    reltol=maximum(abs,d)*eps(T)*log(n)
     for k=1:n
         mx,idx=findmax(d)
         if mx ≤ reltol break end

test/fftBigFloattest.jl

@@ -12,9 +12,9 @@ p = plan_dct(c)
 @test norm(dct(c) - p*c) == 0
 
 pi = plan_idct!(c)
-@test norm(pi*dct(c) - c) < 400norm(c)*eps(BigFloat)
+@test norm(pi*dct(c) - c) < 500norm(c)*eps(BigFloat)
 
 @test norm(dct(c)-dct(map(Float64,c)),Inf) < 10eps()
 
-cc = cis(c)
+cc = cis.(c)
 @test norm(dct(cc)-dct(map(Complex{Float64},cc)),Inf) < 10eps()

test/runtests.jl

@@ -190,17 +190,17 @@ include("fftBigFloattest.jl")
 
 println("Testing equivalence of CXN and ASY methods")
 
-for k in round(Int,logspace(1,4,20))
-    r = randn(k)./√(1:k) # Proven 𝒪(√(log N)) error for ASY method.
-    @test_approx_eq leg2cheb(r) cjt(r,0.,0.)
+for k in round.([Int],logspace(1,4,20))
+    r = randn(k)./(√).(1:k) # Proven 𝒪(√(log N)) error for ASY method.
+    @test leg2cheb(r) ≈ cjt(r,0.,0.)
 end
 
-@test_approx_eq leg2chebu([1.0,2,3,4,5])  [0.546875,0.5,0.5390625,1.25,1.3671875]
+@test leg2chebu([1.0,2,3,4,5])  ≈ [0.546875,0.5,0.5390625,1.25,1.3671875]
 
-c = randn(1000)./√(1:1000);
+c = randn(1000)./(√).(1:1000);
 
-@test_approx_eq leg2cheb(cheb2leg(c)) c
-@test_approx_eq cheb2leg(leg2cheb(c)) c
+@test leg2cheb(cheb2leg(c)) ≈ c
+@test cheb2leg(leg2cheb(c)) ≈ c
 
 @test norm(jac2jac(c,0.,√2/2,-1/4,√2/2)-jjt(c,0.,√2/2,-1/4,√2/2),Inf) < 10length(c)*eps()
 
@@ -213,10 +213,10 @@ N=div((n+1)*(n+2),2)
 v=rand(N)  #Length of v is the no. of Padua points
 Pl=plan_paduatransform!(v)
 IPl=plan_ipaduatransform!(v)
-@test_approx_eq Pl*(IPl*copy(v)) v
-@test_approx_eq IPl*(Pl*copy(v)) v
-@test_approx_eq Pl*copy(v) paduatransform(v)
-@test_approx_eq IPl*copy(v) ipaduatransform(v)
+@test Pl*(IPl*copy(v)) ≈ v
+@test IPl*(Pl*copy(v)) ≈ v
+@test Pl*copy(v) ≈ paduatransform(v)
+@test IPl*copy(v) ≈ ipaduatransform(v)
 
 # check that the return vector is NOT reused
 Pl=plan_paduatransform!(v)
@@ -241,7 +241,7 @@ Interpolates a 2d function at a given point using 2d Chebyshev series.
 function paduaeval(f::Function,x::AbstractFloat,y::AbstractFloat,m::Integer,lex)
     T=promote_type(typeof(x),typeof(y))
     M=div((m+1)*(m+2),2)
-    pvals=Array(T,M)
+    pvals=Vector{T}(M)
     p=paduapoints(T,m)
     map!(f,pvals,p[:,1],p[:,2])
     coeffs=paduatransform(pvals,lex)
@@ -257,11 +257,11 @@ m=130
 l=80
 f_m=paduaeval(f_xy,x,y,m,Val{true})
 g_l=paduaeval(g_xy,x,y,l,Val{true})
-@test_approx_eq f_xy(x,y) f_m
-@test_approx_eq g_xy(x,y) g_l
+@test f_xy(x,y) ≈ f_m
+@test g_xy(x,y) ≈ g_l
 
 
 f_m=paduaeval(f_xy,x,y,m,Val{false})
 g_l=paduaeval(g_xy,x,y,l,Val{false})
-@test_approx_eq f_xy(x,y) f_m
-@test_approx_eq g_xy(x,y) g_l
+@test f_xy(x,y) ≈ f_m
+@test g_xy(x,y) ≈ g_l