p can be Any

Author: jClugstor

ext/LinearSolveForwardDiffExt.jl

@@ -11,23 +11,23 @@ const DualLinearProblem = LinearProblem{
     <:Union{Number, <:AbstractArray, Nothing}, iip,
     <:Union{<:Dual{T, V, P}, <:AbstractArray{<:Dual{T, V, P}}},
     <:Union{<:Dual{T, V, P}, <:AbstractArray{<:Dual{T, V, P}}},
-    <:Union{Number, <:AbstractArray, SciMLBase.NullParameters}
+    <:Any
 } where {iip, T, V, P}
 
 const DualALinearProblem = LinearProblem{
     <:Union{Number, <:AbstractArray, Nothing},
     iip,
     <:Union{<:Dual{T, V, P}, <:AbstractArray{<:Dual{T, V, P}}},
     <:Union{Number, <:AbstractArray},
-    <:Union{Number, <:AbstractArray, SciMLBase.NullParameters}
+    <:Any
 } where {iip, T, V, P}
 
 const DualBLinearProblem = LinearProblem{
     <:Union{Number, <:AbstractArray, Nothing},
     iip,
     <:Union{Number, <:AbstractArray},
     <:Union{<:Dual{T, V, P}, <:AbstractArray{<:Dual{T, V, P}}},
-    <:Union{Number, <:AbstractArray, SciMLBase.NullParameters}
+    <:Any
 } where {iip, T, V, P}
 
 const DualAbstractLinearProblem = Union{