Refactor findall in terms of setdiff

Co-authored-by: Matt Fishman <[email protected]>
ITensor · Jan 14, 2025 · af4a595 · af4a595
1 parent f54c269
commit af4a595
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/src/abstractblocksparsearray/abstractblocksparsematrix.jl b/src/abstractblocksparsearray/abstractblocksparsematrix.jl
@@ -43,8 +43,8 @@ function _allocate_svd_output(A::AbstractBlockSparseMatrix, full::Bool, ::Algori
 
   # fill in values for blocks that aren't present, pairing them in order of occurence
   # this is a convention, which at least gives the expected results for blockdiagonal
-  emptyrows = findall(∉(browIs), 1:bm)
-  emptycols = findall(∉(bcolIs), 1:bn)
+  emptyrows = setdiff(1:bm, browIs)
+  emptycols = setdiff(1:bn, bcolIs)
   for (row, col) in zip(emptyrows, emptycols)
     slengths[col] = min(brows[row], bcols[col])
   end