You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Implementation wise, we could use either sorting (like NumPy) or hash-tables (of some sort) for most of these fucntions.
Some of these could be challenging to implement (would not work under jit), because the output has a dynamic shape. in1d and isin don't have dynamic shapes, but that they probably require searchsorted from #2080 first (at least if using sorting).
The text was updated successfully, but these errors were encountered:
shoyer
changed the title
Implement NumPy's set routines
Implement NumPy set routines
Jan 26, 2020
Extracted from #70:
Implementation wise, we could use either sorting (like NumPy) or hash-tables (of some sort) for most of these fucntions.
Some of these could be challenging to implement (would not work under
jit
), because the output has a dynamic shape.in1d
andisin
don't have dynamic shapes, but that they probably requiresearchsorted
from #2080 first (at least if using sorting).The text was updated successfully, but these errors were encountered: