SparseMatrix x BitArray defaults to dense array multiplication, which is exceedingly slow. I had made custom implementations of these multiplications to work around this, but it's not a good idea to have such low-level, standard operations in custom user code.
Now that I have a fix for upstream issue https://github.com/JuliaLang/julia/issues/32070, I can implement the fix locally and use standard linear algebra, where SparseMatrix * BitArray -> SparseMatrix * Vector(BitArray) (substitute the BitArray with a normal Vector{Bool})
SparseMatrix x BitArray defaults to dense array multiplication, which is exceedingly slow. I had made custom implementations of these multiplications to work around this, but it's not a good idea to have such low-level, standard operations in custom user code.
Now that I have a fix for upstream issue https://github.com/JuliaLang/julia/issues/32070, I can implement the fix locally and use standard linear algebra, where
SparseMatrix * BitArray -> SparseMatrix * Vector(BitArray)(substitute the BitArray with a normal Vector{Bool})