diff options
| author | MilesCranmer <miles.cranmer@gmail.com> | 2022-06-10 14:48:50 -0400 |
|---|---|---|
| committer | MilesCranmer <miles.cranmer@gmail.com> | 2022-06-10 14:48:50 -0400 |
| commit | bd41739886382ec53e02045cba8a1dc2ab4dfc86 (patch) | |
| tree | 648bb1cef3f9015bd8488737d7bb0f2dd82d38bd /numpy/lib/arraysetops.py | |
| parent | a8da1ef8db9d30c2dbc6b8fdd0c5d3b190dfad7b (diff) | |
| download | numpy-bd41739886382ec53e02045cba8a1dc2ab4dfc86.tar.gz | |
DOC: Describe default in docstring
Diffstat (limited to 'numpy/lib/arraysetops.py')
| -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 a08c912d6..8dbb5f765 100644 --- a/numpy/lib/arraysetops.py +++ b/numpy/lib/arraysetops.py @@ -547,7 +547,7 @@ def in1d(ar1, ar2, assume_unique=False, invert=False, method='auto'): to (but is faster than) ``np.invert(in1d(a, b))``. method : {'auto', 'sort', 'dictionary'}, optional The algorithm to use. This will not affect the final result, - but will affect the speed. + but will affect the speed. Default is 'auto'. - If 'sort', will use a sort-based approach. - If 'dictionary', will use a key-dictionary approach similar @@ -746,7 +746,7 @@ def isin(element, test_elements, assume_unique=False, invert=False, than) ``np.invert(np.isin(a, b))``. method : {'auto', 'sort', 'dictionary'}, optional The algorithm to use. This will not affect the final result, - but will affect the speed. + but will affect the speed. Default is 'auto'. - If 'sort', will use a sort-based approach. - If 'dictionary', will use a key-dictionary approach similar |