summaryrefslogtreecommitdiff
path: root/numpy/lib/arraysetops.py
diff options
context:
space:
mode:
authorMilesCranmer <miles.cranmer@gmail.com>2022-06-10 19:59:45 -0400
committerMilesCranmer <miles.cranmer@gmail.com>2022-06-10 19:59:45 -0400
commit9e6bc7911cbea5d04ba4efe9f3dcaaf389d65cd1 (patch)
tree69e9ab80a3e0f98d4e5622b3c5155aa4dfc81d44 /numpy/lib/arraysetops.py
parentd7e2582cd33b22a767286e8a3d95b336dfe51a34 (diff)
downloadnumpy-9e6bc7911cbea5d04ba4efe9f3dcaaf389d65cd1.tar.gz
DOC: Clean up isin docstring
Diffstat (limited to 'numpy/lib/arraysetops.py')
-rw-r--r--numpy/lib/arraysetops.py6
1 files changed, 3 insertions, 3 deletions
diff --git a/numpy/lib/arraysetops.py b/numpy/lib/arraysetops.py
index 6d7d1c397..4a07d6e9e 100644
--- a/numpy/lib/arraysetops.py
+++ b/numpy/lib/arraysetops.py
@@ -555,9 +555,9 @@ def in1d(ar1, ar2, assume_unique=False, invert=False, method='auto'):
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,
- 'dictionary' is chosen. For larger range or smaller
- sizes, 'sort' is chosen.
+ on the size and range of `ar2`. For larger sizes or
+ smaller range, 'dictionary' is chosen.
+ For larger range or smaller sizes, 'sort' is chosen.
.. versionadded:: 1.8.0