From bd41739886382ec53e02045cba8a1dc2ab4dfc86 Mon Sep 17 00:00:00 2001 From: MilesCranmer Date: Fri, 10 Jun 2022 14:48:50 -0400 Subject: DOC: Describe default in docstring --- numpy/lib/arraysetops.py | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'numpy/lib/arraysetops.py') 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 -- cgit v1.2.1