try to remove invalidations (#421)

* try to remove invalidations

* version bump

Author: jverzani

Project.toml

@@ -2,7 +2,7 @@ name = "Polynomials"
 uuid = "f27b6e38-b328-58d1-80ce-0feddd5e7a45"
 license = "MIT"
 author = "JuliaMath"
-version = "3.1.3"
+version = "3.1.4"
 
 [deps]
 LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"

src/common.jl

@@ -485,7 +485,7 @@ Base.all(pred, p::AbstractPolynomial) = all(pred, values(p))
 
 Test whether any coefficient of an `AbstractPolynomial` satisfies predicate `pred`.
 """
-Base.any(pred::Function, p::AbstractPolynomial) = any(pred, values(p))
+Base.any(pred, p::AbstractPolynomial) = any(pred, values(p))
 
 
 

src/polynomials/pi_n_polynomial.jl

@@ -13,7 +13,7 @@ standard basis of degree `n` *or less*, using a vector of length
 This type is useful for reducing copies and allocations in some algorithms.
 
 """
-struct PnPolynomial{T,X} <: Polynomials.StandardBasisPolynomial{T, X}
+struct PnPolynomial{T,X} <: StandardBasisPolynomial{T, X}
     coeffs::Vector{T}
     function PnPolynomial{T, X}(coeffs::AbstractVector{T}) where {T, X}
         N = length(coeffs) - 1