Skip to content

Commit 4abd093

Browse files
Change to ArrayInterfaceCore
1 parent dc47f79 commit 4abd093

File tree

3 files changed

+6
-6
lines changed

3 files changed

+6
-6
lines changed

Project.toml

+2-2
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ authors = ["Kanav Gupta <kanav0610@gmail.com>"]
44
version = "0.3.16"
55

66
[deps]
7-
ArrayInterface = "4fba245c-0d91-5ea0-9b3e-6abc04ee57a9"
7+
ArrayInterfaceCore = "30b0a656-2188-435a-8636-2ec0e6a096e2"
88
FiniteDiff = "6a86dc24-6348-571c-b903-95158fe2bd41"
99
ForwardDiff = "f6369f11-7733-5829-9624-2563aa707210"
1010
IterativeSolvers = "42fd0dbc-a981-5370-80f2-aaf504508153"
@@ -18,7 +18,7 @@ StaticArrays = "90137ffa-7385-5640-81b9-e52037218182"
1818
UnPack = "3a884ed6-31ef-47d7-9d2a-63182c4928ed"
1919

2020
[compat]
21-
ArrayInterface = "3, 4, 5"
21+
ArrayInterfaceCore = "0.1.1"
2222
FiniteDiff = "2"
2323
ForwardDiff = "0.10.3"
2424
IterativeSolvers = "0.9"

src/NonlinearSolve.jl

+1-1
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ using Setfield
88
using StaticArrays
99
using RecursiveArrayTools
1010
using LinearAlgebra
11-
import ArrayInterface
11+
import ArrayInterfaceCore
1212
import IterativeSolvers
1313
import RecursiveFactorization
1414

src/utils.jl

+3-3
Original file line numberDiff line numberDiff line change
@@ -128,7 +128,7 @@ function (p::DefaultLinSolve)(x,A,b,update_matrix=false;tol=nothing, kwargs...)
128128
#
129129
# RecursiveFactorization seems to be consistantly winning below 100
130130
# https://discourse.julialang.org/t/ann-recursivefactorization-jl/39213
131-
if ArrayInterface.can_setindex(x) && (size(A,1) <= 100 || ((blasvendor === :openblas || blasvendor === :openblas64) && size(A,1) <= 500))
131+
if ArrayInterfaceCore.can_setindex(x) && (size(A,1) <= 100 || ((blasvendor === :openblas || blasvendor === :openblas64) && size(A,1) <= 500))
132132
p.A = RecursiveFactorization.lu!(A)
133133
else
134134
p.A = lu!(A)
@@ -141,7 +141,7 @@ function (p::DefaultLinSolve)(x,A,b,update_matrix=false;tol=nothing, kwargs...)
141141
p.A = bunchkaufman!(A)
142142
elseif typeof(A) <: SparseMatrixCSC
143143
p.A = lu(A)
144-
elseif ArrayInterface.isstructured(A)
144+
elseif ArrayInterfaceCore.isstructured(A)
145145
p.A = factorize(A)
146146
elseif !(typeof(A) <: AbstractDiffEqOperator)
147147
# Most likely QR is the one that is overloaded
@@ -156,7 +156,7 @@ function (p::DefaultLinSolve)(x,A,b,update_matrix=false;tol=nothing, kwargs...)
156156
# Missing a little bit of efficiency in a rare case
157157
#elseif typeof(A) <: DiffEqArrayOperator
158158
# ldiv!(x,p.A,b)
159-
elseif ArrayInterface.isstructured(A) || A isa SparseMatrixCSC
159+
elseif ArrayInterfaceCore.isstructured(A) || A isa SparseMatrixCSC
160160
ldiv!(x,p.A,b)
161161
elseif typeof(A) <: AbstractDiffEqOperator
162162
# No good starting guess, so guess zero

0 commit comments

Comments
 (0)