Open garyzhubc opened 1 year ago
Set intersection seems like a standard operation that can be speeded up and stored efficiently. I'm currently looking into ways to make this faster.
One suggestion is to use hashset data structure so one can achieve constant look-up. For instance, https://cran.r-project.org/web/packages/sets/.
Set intersection seems like a standard operation that can be speeded up and stored efficiently. I'm currently looking into ways to make this faster.