isstored

Author: lkdvos

src/factorizations/eig.jl

@@ -100,7 +100,7 @@ for f in [:eig_full!, :eigh_full!]
       # do decomposition on each block
       for I in 1:min(blocksize(A)...)
         bI = Block(I, I)
-        if isstored(blocks(A), CartesianIndex(I, I)) # TODO: isblockstored
+        if isstored(A, bI)
           block = @view!(A[bI])
           block_alg = block_algorithm(alg, block)
           bD, bV = $f(block, block_alg)

src/factorizations/lq.jl

@@ -101,7 +101,7 @@ function MatrixAlgebraKit.lq_compact!(
   # do decomposition on each block
   for I in 1:min(blocksize(A)...)
     bI = Block(I, I)
-    if isstored(blocks(A), CartesianIndex(I, I)) # TODO: isblockstored
+    if isstored(A, bI)
       block = @view!(A[bI])
       block_alg = block_algorithm(alg, block)
       bL, bQ = lq_compact!(block, block_alg)
@@ -132,7 +132,7 @@ function MatrixAlgebraKit.lq_full!(
 
   for I in 1:min(blocksize(A)...)
     bI = Block(I, I)
-    if isstored(blocks(A), CartesianIndex(I, I)) # TODO: isblockstored
+    if isstored(A, bI)
       block = @view!(A[bI])
       block_alg = block_algorithm(alg, block)
       bL, bQ = lq_full!(block, block_alg)

src/factorizations/qr.jl

@@ -103,7 +103,7 @@ function MatrixAlgebraKit.qr_compact!(
   # do decomposition on each block
   for I in 1:min(blocksize(A)...)
     bI = Block(I, I)
-    if isstored(blocks(A), CartesianIndex(I, I)) # TODO: isblockstored
+    if isstored(A, bI)
       block = @view!(A[bI])
       block_alg = block_algorithm(alg, block)
       bQ, bR = qr_compact!(block, block_alg)
@@ -135,7 +135,7 @@ function MatrixAlgebraKit.qr_full!(
 
   for I in 1:min(blocksize(A)...)
     bI = Block(I, I)
-    if isstored(blocks(A), CartesianIndex(I, I)) # TODO: isblockstored
+    if isstored(A, bI)
       block = @view!(A[bI])
       block_alg = block_algorithm(alg, block)
       bQ, bR = qr_full!(block, block_alg)

src/factorizations/svd.jl

@@ -160,7 +160,7 @@ function MatrixAlgebraKit.svd_compact!(
 
   for I in 1:min(blocksize(A)...)
     bI = Block(I, I)
-    if isstored(blocks(A), CartesianIndex(I, I)) # TODO: isblockstored
+    if isstored(A, bI)
       block = @view!(A[bI])
       block_alg = block_algorithm(alg, block)
       bU, bS, bVᴴ = svd_compact!(block, block_alg)
@@ -196,7 +196,7 @@ function MatrixAlgebraKit.svd_full!(
 
   for I in 1:min(blocksize(A)...)
     bI = Block(I, I)
-    if isstored(blocks(A), CartesianIndex(I, I)) # TODO: isblockstored
+    if isstored(A, bI)
       block = @view!(A[bI])
       block_alg = block_algorithm(alg, block)
       bU, bS, bVᴴ = svd_full!(block, block_alg)