Format

Author: mtfishman

src/kroneckerarray.jl

@@ -168,15 +168,19 @@ function Base.getindex(a::KroneckerArray{<:Any,N}, I::Vararg{Integer,N}) where {
 end
 
 # Indexing logic.
-function Base.to_indices(a::KroneckerArray, inds, I::Tuple{Union{CartesianPair,CartesianProduct},Vararg})
+function Base.to_indices(
+  a::KroneckerArray, inds, I::Tuple{Union{CartesianPair,CartesianProduct},Vararg}
+)
   I1 = to_indices(arg1(a), arg1.(inds), arg1.(I))
   I2 = to_indices(arg2(a), arg2.(inds), arg2.(I))
   return I1 .× I2
 end
 
 # Allow customizing for `FillArrays.Eye`.
 _getindex(a::AbstractArray, I...) = a[I...]
-function Base.getindex(a::KroneckerArray{<:Any,N}, I::Vararg{Union{CartesianPair,CartesianProduct},N}) where {N}
+function Base.getindex(
+  a::KroneckerArray{<:Any,N}, I::Vararg{Union{CartesianPair,CartesianProduct},N}
+) where {N}
   I′ = to_indices(a, I)
   return _getindex(arg1(a), arg1.(I′)...) ⊗ _getindex(arg2(a), arg2.(I′)...)
 end

test/test_blocksparsearrays.jl

@@ -48,7 +48,8 @@ arrayts = (Array, JLArray)
   @test a[Block(2, 2)[(2:3) × (2:3), (2:3) × (2:3)]] ==
     a[Block(2, 2)][(2:3) × (2:3), (2:3) × (2:3)]
   @test a[Block(2, 2)[(:) × (2:3), (:) × (2:3)]] == a[Block(2, 2)][(:) × (2:3), (:) × (2:3)]
-  @test a[Block(2, 2)[(1:2) × (2:3), (:) × (2:3)]] == a[Block(2, 2)][(1:2) × (2:3), (:) × (2:3)]
+  @test a[Block(2, 2)[(1:2) × (2:3), (:) × (2:3)]] ==
+    a[Block(2, 2)][(1:2) × (2:3), (:) × (2:3)]
 
   # Blockwise slicing, shows up in truncated block sparse matrix factorizations.
   I1 = BlockIndexVector(Block(1), Base.Slice(Base.OneTo(2)) × [1])
@@ -169,7 +170,8 @@ end
   @test a[Block(2, 2)[(2:3) × (2:3), (2:3) × (2:3)]] ==
     a[Block(2, 2)][(2:3) × (2:3), (2:3) × (2:3)]
   @test a[Block(2, 2)[(:) × (2:3), (:) × (2:3)]] == a[Block(2, 2)][(:) × (2:3), (:) × (2:3)]
-  @test a[Block(2, 2)[(1:2) × (2:3), (:) × (2:3)]] == a[Block(2, 2)][(1:2) × (2:3), (:) × (2:3)]
+  @test a[Block(2, 2)[(1:2) × (2:3), (:) × (2:3)]] ==
+    a[Block(2, 2)][(1:2) × (2:3), (:) × (2:3)]
 
   # Blockwise slicing, shows up in truncated block sparse matrix factorizations.
   I1 = BlockIndexVector(Block(1), Base.Slice(Base.OneTo(2)) × [1])