functioncall struct

Author: vpuri3

src/default.jl

@@ -53,11 +53,19 @@ end
 
 function SciMLBase.solve(cache::LinearCache, alg::Nothing,
                          args...; kwargs...)
-    @unpack A = cache
+    @unpack A, b, u = cache
     if A isa DiffEqArrayOperator
         A = A.A
     end
 
+    if applicable(ldiv!, A, u)
+        alg = FunctionCall(ldiv!, (A, u))
+        SciMLBase.solve(cache, alg, args...; kwargs...)
+    elseif applicable(ldiv!, u, A, b)
+        alg = FunctionCall(ldiv!, (u, A, b))
+        SciMLBase.solve(cache, alg, args...; kwargs...)
+    end
+
     # Special case on Arrays: avoid BLAS for RecursiveFactorization.jl when
     # it makes sense according to the benchmarks, which is dependent on
     # whether MKL or OpenBLAS is being used

src/function_call.jl

@@ -0,0 +1,22 @@
+struct FunctionCall{F,A,K} <: SciMLLinearSolveAlgorithm
+    func::F
+    args::A
+    kwargs::K
+
+    function FunctionCall(func::Function, args::Tuple; kwargs...)
+        @assert iscallable(func)
+        @assert applicable(func, args; kwargs)
+
+        new{typeof(func), typeof(args), typeof(kwargs)}(func, args, kwargs)
+    end
+end
+
+function init_cacheval(alg::FunctionCall, cache::LinearCache)
+    cache.cacheval
+end
+
+function SciMLBase.solve(cache::LinearCache, alg::FunctionCall,
+                         args...; kwargs...)
+
+    return
+end