diff options
| author | Miles Cranmer <miles.cranmer@gmail.com> | 2022-06-18 06:20:16 +0000 |
|---|---|---|
| committer | Miles Cranmer <miles.cranmer@gmail.com> | 2022-06-18 06:20:16 +0000 |
| commit | 0c339d4238d55cc3dd45236f5e7ccff503e007bf (patch) | |
| tree | d48efba645f535ef063189b786b7b5a5b47788ca /numpy/lib/arraysetops.py | |
| parent | 76bb035b4755454150e1ae089a0b2331e40fa723 (diff) | |
| download | numpy-0c339d4238d55cc3dd45236f5e7ccff503e007bf.tar.gz | |
DOC: Add missing indent in docstring
Diffstat (limited to 'numpy/lib/arraysetops.py')
| -rw-r--r-- | numpy/lib/arraysetops.py | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/numpy/lib/arraysetops.py b/numpy/lib/arraysetops.py index 8af8c8803..74cbd0965 100644 --- a/numpy/lib/arraysetops.py +++ b/numpy/lib/arraysetops.py @@ -545,7 +545,7 @@ def in1d(ar1, ar2, assume_unique=False, invert=False, kind=None): False where an element of `ar1` is in `ar2` and True otherwise). Default is False. ``np.in1d(a, b, invert=True)`` is equivalent to (but is faster than) ``np.invert(in1d(a, b))``. - kind : {None, 'mergesort', 'dictionary'}, optional + kind : {None, 'mergesort', 'dictionary'}, optional The algorithm to use. This will not affect the final result, but will affect the speed. Default will select automatically based on memory considerations. |