Closed lmcinnes closed 2 years ago
Sparse binary distances were slow due to using naive intersection / union implementations. If we assume indices are sorted (which they should be as we require it elsewhere) then we can go much faster.
Sparse binary distances were slow due to using naive intersection / union implementations. If we assume indices are sorted (which they should be as we require it elsewhere) then we can go much faster.