From 2e203673b39da5bb83ae78fa80071fd421ca8d8c Mon Sep 17 00:00:00 2001
From: jverzani <jverzani@gmail.com>
Date: Fri, 3 Jun 2022 11:45:42 -0400
Subject: [PATCH 1/2] try to remove invalidations

---
 src/common.jl                      | 2 +-
 src/polynomials/pi_n_polynomial.jl | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/common.jl b/src/common.jl
index 9ad30a9e..2bdba7c4 100644
--- a/src/common.jl
+++ b/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))
 
 
 
diff --git a/src/polynomials/pi_n_polynomial.jl b/src/polynomials/pi_n_polynomial.jl
index ec8cddd4..cc98827d 100644
--- a/src/polynomials/pi_n_polynomial.jl
+++ b/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

From 016b873f06ee9f7b8fac0ad98a98590564ed6791 Mon Sep 17 00:00:00 2001
From: jverzani <jverzani@gmail.com>
Date: Fri, 3 Jun 2022 13:22:20 -0400
Subject: [PATCH 2/2] version bump

---
 Project.toml | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Project.toml b/Project.toml
index 77f2b174..a6b43055 100644
--- a/Project.toml
+++ b/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"