cleanup

Author: jverzani

src/common.jl

@@ -173,10 +173,6 @@ In-place version of [`truncate`](@ref)
 function truncate!(p::AbstractPolynomial{T};
     rtol::Real = Base.rtoldefault(real(T)),
                    atol::Real = 0,) where {T}
-
-    # 
-
-    
     max_coeff = maximum(abs, coeffs(p))
     thresh = max_coeff * rtol + atol
     map!(c->abs(c) <= thresh ? zero(T) : c, coeffs(p), coeffs(p))
@@ -362,10 +358,6 @@ Base.lastindex(p::AbstractPolynomial) = length(p) - 1
 Base.eachindex(p::AbstractPolynomial) = 0:length(p) - 1
 Base.broadcastable(p::AbstractPolynomial) = Ref(p)
 
-
-
-
-
 # iteration
 # iteration occurs over the basis polynomials
 Base.iterate(p::AbstractPolynomial) = (p[0] * one(typeof(p)), 1)
@@ -566,7 +558,6 @@ Base.:(==)(p1::AbstractPolynomial, p2::AbstractPolynomial) =
 Base.:(==)(p::AbstractPolynomial, n::Number) = degree(p) <= 0 && p[0] == n
 Base.:(==)(n::Number, p::AbstractPolynomial) = p == n
 
-
 function Base.isapprox(p1::AbstractPolynomial{T},
     p2::AbstractPolynomial{S};
     rtol::Real = (Base.rtoldefault(T, S, 0)),
@@ -592,7 +583,6 @@ function Base.isapprox(p1::AbstractPolynomial{T},
     isapprox(coeffs(p1t), [n], rtol = rtol, atol = atol)
 end
 
-
 Base.isapprox(n::S,
     p1::AbstractPolynomial{T};
     rtol::Real = (Base.rtoldefault(T, S, 0)),

src/contrib.jl

@@ -37,10 +37,8 @@ function evalpoly(x::S, p::Tuple) where {S}
     if @generated
         N = length(p.parameters)
         ex = :(p[end]*_one(S))
-        if N > 0
-            for i in N-1:-1:1
-                ex = :(_muladd(x, $ex, p[$i]))
-            end
+        for i in N-1:-1:1
+            ex = :(_muladd(x, $ex, p[$i]))
         end
         ex
     else

src/polynomials/standard-basis.jl

@@ -2,7 +2,6 @@ abstract type StandardBasisPolynomial{T} <: AbstractPolynomial{T} end
 
 
 
-
 function showterm(io::IO, ::Type{<:StandardBasisPolynomial}, pj::T, var, j, first::Bool, mimetype) where {T} 
     if iszero(pj) return false end
     pj = printsign(io, pj, first, mimetype)
@@ -14,7 +13,6 @@ function showterm(io::IO, ::Type{<:StandardBasisPolynomial}, pj::T, var, j, firs
     return true
 end
 
-
 # allows  broadcast  issue #209
 evalpoly(x, p::StandardBasisPolynomial) = p(x)
 

src/show.jl

@@ -247,7 +247,7 @@ function unicode_exponent(io, j)
 end
 
 function unicode_subscript(io, j)
-    a = ("⁻","","","₀","₁","₂","₃","₄","₅","₆","₇","₈","₉")
+    a = ("₋","","","₀","₁","₂","₃","₄","₅","₆","₇","₈","₉")
     for i in string(j)
         print(io, a[Int(i)-44])
     end