Fix 0.4 deprecated bindings. Fix test and rename tests.jl to runtests.jl

Author: yuyichao

REQUIRE

@@ -0,0 +1,2 @@
+julia 0.3
+Compat

src/Polynomials.jl

@@ -3,6 +3,8 @@
 module Polynomials
 #todo: sparse polynomials?
 
+using Compat
+
 export Poly, polyval, polyint, polyder, poly, roots
 export Pade, padeval
 
@@ -11,7 +13,7 @@ import Base: show, print, *, /, //, -, +, ==, divrem, rem, eltype
 import Base: promote_rule
 
 eps{T}(::Type{T}) = zero(T)
-eps{F<:FloatingPoint}(x::Type{F}) = Base.eps(F)
+eps{F<:AbstractFloat}(x::Type{F}) = Base.eps(F)
 eps{T}(x::Type{Complex{T}}) = eps(T)
 
 immutable Poly{T<:Number}
@@ -22,7 +24,7 @@ immutable Poly{T<:Number}
     end
 end
 
-Poly{T<:Number}(a::Vector{T}, var::Union(String,Symbol,Char)=:x) = Poly{T}(a, var)
+@compat Poly{T<:Number}(a::Vector{T}, var::Union{AbstractString,Symbol,Char}=:x) = Poly{T}(a, var)
 
 convert{T}(::Type{Poly{T}}, p::Poly) = Poly(convert(Vector{T}, p.a), p.var)
 convert{T, S<:Number}(::Type{Poly{T}}, x::S) = Poly(promote_type(T, S)[x])
@@ -304,7 +306,7 @@ function poly{T}(r::AbstractVector{T}, var=:x)
     return Poly(reverse(c), var)
 end
 poly(A::Matrix, var=:x) = poly(eig(A)[1], var)
-poly(A::Matrix, var::String) = poly(eig(A)[1], symbol(var))
+poly(A::Matrix, var::AbstractString) = poly(eig(A)[1], symbol(var))
 poly(A::Matrix, var::Char) = poly(eig(A)[1], symbol(var))
 
 roots{T}(p::Poly{Rational{T}}) = roots(convert(Poly{promote_type(T, Float64)}, p))

src/pade.jl

@@ -13,7 +13,7 @@ Pade{T<:Number,S<:Number}(p::Poly{T}, q::Poly{S}) = Pade{T,S}(p,q)
 
 function Pade{T}(c::Poly{T},m::Int,n::Int)
     @assert m+n < length(c)
-    rold,rnew = Poly([zeros(T,m+n+1),one(T)],c.var),Poly(c.a[1:m+n+1],c.var)
+    rold,rnew = Poly([zeros(T,m+n+1);one(T)],c.var),Poly(c.a[1:m+n+1],c.var)
     uold,vold = Poly([one(T)],c.var),Poly([zero(T)],c.var)
     unew,vnew = vold,uold
     for i=1:n
@@ -30,4 +30,4 @@ function Pade{T}(c::Poly{T},m::Int,n::Int)
     end
     Pade(rnew/vnew[0],vnew/vnew[0])
 end
-padeval{T}(PQ::Pade{T},x) = polyval(PQ.p,x)./polyval(PQ.q,x)
+padeval{T}(PQ::Pade{T},x) = polyval(PQ.p,x)./polyval(PQ.q,x)

test/tests.jl renamed to test/runtests.jl

@@ -1,4 +1,5 @@
 # assert file to test polynomial implementation
+using Compat
 using Base.Test
 using Polynomials
 
@@ -32,7 +33,7 @@ sprint(show, pNULL)
 @test pNULL^3 == pNULL
 @test pNULL*pNULL == pNULL
 
-@test map(Polynomials.degree, [pNULL,p0,p1,p2,p3,p4,p5,pN,pR,p1000]) == [0,0,0,1,2,3,4,4,2,999] 
+@test map(Polynomials.degree, [pNULL,p0,p1,p2,p3,p4,p5,pN,pR,p1000]) == [0,0,0,1,2,3,4,4,2,999]
 
 @test polyval(pN, -.125) == 276.9609375
 @test polyval(pNULL, 10) == 0
@@ -95,26 +96,27 @@ pcpy2 = copy(pcpy1)
 #Tests for Pade approximants
 
 println("Test for the exponential function.")
-a = Poly(1.//convert(Vector{Int},gamma(1:17)),"x")
+a = Poly(1.//convert(Vector{BigInt},gamma(BigFloat(1):BigFloat(17))),"x")
 PQexp = Pade(a,8,8)
-@test padeval(PQexp,1.0) == exp(1.0)
-@test padeval(PQexp,-1.0) == exp(-1.0)
+@test isapprox(convert(Float64, padeval(PQexp,1.0)), exp(1.0))
+@test isapprox(convert(Float64, padeval(PQexp,-1.0)), exp(-1.0))
 
 println("Test for the sine function.")
-b = Poly(convert(Vector{BigInt},sinpi((0:16)/2)).//convert(Vector{BigInt},gamma(BigFloat("1.0"):BigFloat("17.0"))),"x")
+b = Poly(convert(Vector{BigInt},sinpi((0:16)/2)).//convert(Vector{BigInt},gamma(BigFloat(1):BigFloat(17))),"x")
 PQsin = Pade(b,8,7)
-@test isapprox(padeval(PQsin,1.0),sin(1.0))
-@test isapprox(padeval(PQsin,-1.0),sin(-1.0))
+@test isapprox(convert(Float64, padeval(PQsin,1.0)), sin(1.0))
+@test isapprox(convert(Float64, padeval(PQsin,-1.0)),sin(-1.0))
 
 println("Test for the cosine function.")
-c = Poly(convert(Vector{BigInt},sinpi((1:17)/2)).//convert(Vector{BigInt},gamma(BigFloat("1.0"):BigFloat("17.0"))),"x")
+c = Poly(convert(Vector{BigInt},sinpi((1:17)/2)).//convert(Vector{BigInt},gamma(BigFloat(1):BigFloat(17))),"x")
 PQcos = Pade(c,8,8)
-@test isapprox(padeval(PQcos,1.0),cos(1.0))
-@test isapprox(padeval(PQcos,-1.0),cos(-1.0))
+@test isapprox(convert(Float64, padeval(PQcos,1.0)), cos(1.0))
+@test isapprox(convert(Float64, padeval(PQcos,-1.0)), cos(-1.0))
 
 println("Test for the summation of a factorially divergent series.")
-d = Poly(convert(Vector{BigInt},(-1).^(0:60).*gamma(BigFloat("1.0"):BigFloat("61.0"))).//1,"x")
+d = Poly(convert(Vector{BigInt},(-1).^(0:60).*gamma(BigFloat(1):BigFloat(61.0))).//1,"x")
 PQexpint = Pade(d,30,30)
-println("The approximate sum of the divergent series is:  ",float64(padeval(PQexpint,1.0)))
+@compat println("The approximate sum of the divergent series is:  ", Float64(padeval(PQexpint,1.0)))
 println("The approximate sum of the convergent series is: ",exp(1)*(-γ-sum([(-1).^k/k./gamma(k+1) for k=1:20])))
-@test isapprox(padeval(PQexpint,1.0) , exp(1)*(-γ-sum([(-1).^k/k./gamma(k+1) for k=1:20])))
+@test isapprox(convert(Float64, padeval(PQexpint,1.0)),
+               exp(1)*(-γ-sum([(-1).^k/k./gamma(k+1) for k=1:20])))