diff options
| author | MilesCranmer <miles.cranmer@gmail.com> | 2022-06-10 16:49:14 -0400 |
|---|---|---|
| committer | MilesCranmer <miles.cranmer@gmail.com> | 2022-06-10 16:49:14 -0400 |
| commit | d3081b65ec8361e2f5b4890286eba441f1081d34 (patch) | |
| tree | b0b0c2bf3c51095c490c0b6519ccedb4b266c1c9 /numpy | |
| parent | 530ccde5297ee36bc8b142b4f2cc8486ba90a678 (diff) | |
| download | numpy-d3081b65ec8361e2f5b4890286eba441f1081d34.tar.gz | |
DOC: Improve docstring explanation
Diffstat (limited to 'numpy')
| -rw-r--r-- | numpy/lib/arraysetops.py | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/numpy/lib/arraysetops.py b/numpy/lib/arraysetops.py index 954e915b7..90b5f0419 100644 --- a/numpy/lib/arraysetops.py +++ b/numpy/lib/arraysetops.py @@ -551,7 +551,7 @@ 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. This is only available for boolean and + to a counting 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 @@ -751,7 +751,7 @@ 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. This is only available for boolean and + to a counting 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 |