diff options
| author | MilesCranmer <miles.cranmer@gmail.com> | 2022-06-10 14:42:34 -0400 |
|---|---|---|
| committer | MilesCranmer <miles.cranmer@gmail.com> | 2022-06-10 14:42:34 -0400 |
| commit | 281dadc5fbe8c49df12125dec66040dd55d69e49 (patch) | |
| tree | 38ec25b85ca1e77a10b5fd3604c7a565b2b76d5c /numpy/lib/arraysetops.py | |
| parent | d1a5309810cc55da8443568d215f1992c7a261cd (diff) | |
| download | numpy-281dadc5fbe8c49df12125dec66040dd55d69e49.tar.gz | |
DOC: Specify constraints of method in docstring
Diffstat (limited to 'numpy/lib/arraysetops.py')
| -rw-r--r-- | numpy/lib/arraysetops.py | 6 |
1 files changed, 4 insertions, 2 deletions
diff --git a/numpy/lib/arraysetops.py b/numpy/lib/arraysetops.py index 6320ea1a5..a08c912d6 100644 --- a/numpy/lib/arraysetops.py +++ b/numpy/lib/arraysetops.py @@ -551,7 +551,8 @@ def in1d(ar1, ar2, assume_unique=False, invert=False, method='auto'): - If 'sort', will use a sort-based approach. - If 'dictionary', will use a key-dictionary approach similar - to a radix sort. + to a radix sort. This is only available for boolean and + integer arrays. - If 'auto', will automatically choose the method which is expected to perform the fastest, which depends on the size and range of `ar2`. For larger sizes, @@ -749,7 +750,8 @@ def isin(element, test_elements, assume_unique=False, invert=False, - If 'sort', will use a sort-based approach. - If 'dictionary', will use a key-dictionary approach similar - to a radix sort. + to a radix sort. This is only available for boolean and + integer arrays. - If 'auto', will automatically choose the method which is expected to perform the fastest, which depends on the size and range of `ar2`. For larger sizes, |