reduce unbound args (#442)

Author: hyrodium

src/common.jl

@@ -944,12 +944,7 @@ function scalar_mult(c::S, p::P) where {S, T, X, P<:AbstractPolynomial{T, X}}
     𝐏([c * pᵢ for pᵢ ∈ coeffs(p)])
 end
 
-scalar_mult(c::S, p::Union{P, R}) where {
-    S<: AbstractPolynomial,
-    T, X,
-    P<:AbstractPolynomial{T, X},
-    R <:AbstractPolynomial{T}
-} = throw(DomainError()) # avoid ambiguity, issue #435
+scalar_mult(p1::AbstractPolynomial, p2::AbstractPolynomial) = error("scalar_mult(::$(typeof(p1)), ::$(typeof(p2))) is not defined.") # avoid ambiguity, issue #435
 
 function Base.:/(p::P, c::S) where {P <: AbstractPolynomial,S}
     _convert(p, coeffs(p) ./ c)

src/polynomials/ChebyshevT.jl

@@ -271,7 +271,7 @@ function Base.divrem(num::ChebyshevT{T,X}, den::ChebyshevT{S,Y}) where {T,X,S,Y}
     return P(q_coeff), P(r_coeff)
 end
 
-function showterm(io::IO, ::Type{ChebyshevT{T,X}}, pj::T, var, j, first::Bool, mimetype) where {N, T,X}
+function showterm(io::IO, ::Type{ChebyshevT{T,X}}, pj::T, var, j, first::Bool, mimetype) where {T,X}
     iszero(pj) && return false
     !first &&  print(io, " ")
     if hasneg(T)

src/rational-functions/common.jl

@@ -82,7 +82,7 @@ function Base.convert(::Type{P}, pq::PQ) where {P<:AbstractPolynomial, PQ<:Abstr
     convert(P, p) / constantterm(q)
 end
 
-function Base.convert(::Type{S}, pq::PQ) where {S<:Number, T,X,P,PQ<:AbstractRationalFunction}
+function Base.convert(::Type{S}, pq::PQ) where {S<:Number, PQ<:AbstractRationalFunction}
     !isconstant(pq) && throw(ArgumentError("Can't convert non-constant rational function to a number"))
     S(pq(0))
 end