Fixes

Author: blegat

src/default_polynomial.jl

@@ -289,7 +289,7 @@ end
 function MA.buffer_for(op::MA.AddSubMul, ::Type{<:Polynomial{S}}, ::Type{<:AbstractTermLike{T}}, ::Type{<:Polynomial{U}}) where {S,T,U}
     return MA.buffer_for(op, S, T, U)
 end
-function MA.buffered_operate!(buffer, op::MA.AddSubMul, p::Polynomial, t::AbstractTermLike, q::Polynomial)
+function MA.buffered_operate!(buffer::Polynomial, op::MA.AddSubMul, p::Polynomial, t::AbstractTermLike, q::Polynomial)
     return _polynomial_merge!(op, p, t, q, buffer)
 end
 

src/division.jl

@@ -105,8 +105,6 @@ function div_multiple(f::APL, g::APL, mf::MA.MutableTrait=MA.IsNotMutable())
     end
     return q
 end
-# 2-arguments useful to be used with `Base.Fix2`
-_div_multiple!(a, b) = div_multiple(a, b, MA.IsMutable())
 
 Base.div(f::APL, g::Union{APL, AbstractVector{<:APL}}; kwargs...) = divrem(f, g; kwargs...)[1]
 Base.rem(f::APL, g::Union{APL, AbstractVector{<:APL}}; kwargs...) = divrem(f, g; kwargs...)[2]

src/gcd.jl

@@ -550,7 +550,7 @@ function univariate_gcd(
     return pp
 end
 
-function univariate_gcd(::Field, p1::APL, p2::APL, algo::AbstractUnivariateGCDAlgorithm, m1::MA.MutableTrait, m2::MA.MutableTrait)
+function univariate_gcd(::Field, p1::APL, p2::APL, algo::AbstractUnivariateGCDAlgorithm, m1::MA.MutableTrait, m2::MA.MutableTrait, buffer=nothing)
     return primitive_univariate_gcd!(_copy(p1, m1), _copy(p2, m2), algo, buffer)
 end