Bump nested Taylor1s mutating methods of subst, div and pow to NumberNotSeriesN as suggested by @lbenet

Author: LuEdRaMo

src/arithmetic.jl

@@ -473,7 +473,7 @@ for (f, fc) in ((:+, :(add!)), (:-, :(subst!)))
     end
 end
 
-function subst!(v::Taylor1{Taylor1{T}}, a::Taylor1{Taylor1{T}}, k::Int) where {T <: TS.NumberNotSeries}
+function subst!(v::Taylor1{Taylor1{T}}, a::Taylor1{Taylor1{T}}, k::Int) where {T <: NumberNotSeriesN}
     @inbounds for i in eachindex(v[k])
         v[k][i] = -a[k][i]
     end
@@ -1236,7 +1236,7 @@ function div!(c::Taylor1, a::NumberNotSeries, b::Taylor1)
 end
 
 @inline function div!(c::Taylor1{Taylor1{T}}, a::NumberNotSeries,
-        b::Taylor1{Taylor1{T}}, k::Int) where {T<:NumberNotSeries}
+        b::Taylor1{Taylor1{T}}, k::Int) where {T<:NumberNotSeriesN}
     zero!(c, k)
     iszero(a) && !iszero(b) && return nothing
     # order and coefficient of first factorized term

src/power.jl

@@ -322,7 +322,7 @@ end
 end
 
 @inline function pow!(c::Taylor1{Taylor1{T}}, a::Taylor1{Taylor1{T}}, aux::Taylor1{Taylor1{T}},
-        r::S, k::Int) where {T<:NumberNotSeries, S<:Real}
+        r::S, k::Int) where {T<:NumberNotSeriesN, S<:Real}
     (r == 0) && return one!(c, a, k)
     (r == 1) && return identity!(c, a, k)
     (r == 2) && return sqr!(c, a, aux[k], k)