Efficiently find row intersections of two 2-D numpy arrays

Question

I am trying to figure out an efficient way of finding row intersections of two np.arrays.

Two arrays have the same shapes, and duplicate values in each

Answer 1

I can't think of a clean pure-numpy solution, but the following suggestion should speed things up, potentially dramatically:

1. use numba. It is as simple as decorating your get_intersect1ds function with @autojit
2. pass assume_unique = True when you call intersect1d