Fix v0.6 warnings and drop v0.5

Author: blegat

REQUIRE

@@ -1,2 +1 @@
-julia 0.5
-Compat 0.17
+julia 0.6-

src/MultivariatePolynomials.jl

@@ -2,11 +2,9 @@ __precompile__()
 
 module MultivariatePolynomials
 
-using Compat
-
 import Base: show, length, getindex, vect, isless, isempty, start, done, next, convert, dot, copy, eltype, zero, one
 
-@compat abstract type PolyType{C} end
+abstract type PolyType{C} end
 export iscomm
 iscomm{C}(::PolyType{C}) = C
 zero{C}(::Type{PolyType{C}}) = zero(Polynomial{C, Int})

src/algebraicset.jl

@@ -1,10 +1,10 @@
 export AbstractSemialgebraicSet, AbstractBasicSemialgebraicSet, AbstractAlgebraicSet
 export FullSpace, AlgebraicSet, BasicSemialgebraicSet, addequality!, addinequality!
 # Semialgebraic set described by polynomials with coefficients in T
-@compat abstract type AbstractSemialgebraicSet end
+abstract type AbstractSemialgebraicSet end
 
-@compat abstract type AbstractBasicSemialgebraicSet <: AbstractSemialgebraicSet end
-@compat abstract type AbstractAlgebraicSet <: AbstractBasicSemialgebraicSet end
+abstract type AbstractBasicSemialgebraicSet <: AbstractSemialgebraicSet end
+abstract type AbstractAlgebraicSet <: AbstractBasicSemialgebraicSet end
 
 addinequality!(S::AbstractAlgebraicSet, p) = throw(ArgumentError("Cannot add inequality to an algebraic set"))
 

src/mono.jl

@@ -30,7 +30,7 @@ end
 immutable PolyVar{C} <: PolyType{C}
     id::Int
     name::AbstractString
-    function PolyVar{C}(name::AbstractString) where {C}
+    function PolyVar{C}(name::AbstractString) where C
         # gensym returns something like Symbol("##42")
         # we first remove "##" and then parse it into an Int
         id = parse(Int, string(gensym())[3:end])
@@ -150,7 +150,7 @@ type MonomialVector{C} <: PolyType{C}
     vars::Vector{PolyVar{C}}
     Z::Vector{Vector{Int}}
 
-    function MonomialVector{C}(vars::Vector{PolyVar{C}}, Z::Vector{Vector{Int}}) where {C}
+    function MonomialVector{C}(vars::Vector{PolyVar{C}}, Z::Vector{Vector{Int}}) where C
         for z in Z
             if length(vars) != length(z)
                 throw(ArgumentError("There should be as many vars than exponents"))
@@ -313,7 +313,7 @@ function sortmonovec{C, T<:Union{PolyType,Int}}(::Type{PolyVar{C}}, X::Vector{T}
         σ, MonomialVector{C}(allvars, Z[σ])
     end
 end
-VectorOfPolyType{C} = Union{PolyType{C},Int}
+const VectorOfPolyType{C} = Union{PolyType{C},Int}
 sortmonovec{T<:VectorOfPolyType{false}}(x::Vector{T}) = sortmonovec(PolyVar{false}, x)
 sortmonovec{T<:VectorOfPolyType{true}}(x::Vector{T}) = sortmonovec(PolyVar{true}, x)
 function (::Type{MonomialVector{C}}){C}(X::Vector)

src/poly.jl

@@ -3,15 +3,15 @@ export monomial, monomials, removeleadingterm, removemonomials
 export leadingcoef, leadingmonomial, leadingterm
 export getmat, divides
 
-@compat abstract type TermType{C, T} <: PolyType{C} end
+abstract type TermType{C, T} <: PolyType{C} end
 eltype{C, T}(::Type{TermType{C, T}}) = T
 eltype{C, T}(p::TermType{C, T}) = T
 zero{C, T}(t::TermType{C, T}) = Polynomial(T[], MonomialVector{C}(vars(t), Vector{Vector{Int}}()))
 #zero{T<:TermType}(::Type{T}) = Polynomial(eltype(T)[], MonomialVector{iscomm(T)}())
 one{C, T}(t::TermType{C, T}) = Polynomial([one(T)], MonomialVector{C}(vars(t), [zeros(Int, length(vars(t)))]))
 #one{T<:TermType}(::Type{T}) = Polynomial([one(eltype(T))], MonomialVector{iscomm(T)}(PolyVar[], [Int[]]))
 
-@compat abstract type TermContainer{C, T} <: TermType{C, T} end
+abstract type TermContainer{C, T} <: TermType{C, T} end
 eltype{C, T}(::Type{TermContainer{C, T}}) = T
 zero{C, T}(::Type{TermContainer{C, T}}) = zero(Polynomial{C, T})
 one{C, T}(::Type{TermContainer{C, T}}) = one(Polynomial{C, T})
@@ -80,7 +80,8 @@ type Polynomial{C, T} <: TermContainer{C, T}
     x::MonomialVector{C}
 
     function Polynomial{C, T}(a::Vector{T}, x::MonomialVector{C}) where {C, T}
-        if length(a) != length(x) throw(ArgumentError("There should be as many coefficient than monomials"))
+        if length(a) != length(x)
+            throw(ArgumentError("There should be as many coefficient than monomials"))
         end
         zeroidx = Int[]
         for (i,α) in enumerate(a)