diff options
| author | MilesCranmer <miles.cranmer@gmail.com> | 2022-06-17 19:30:36 -0400 |
|---|---|---|
| committer | MilesCranmer <miles.cranmer@gmail.com> | 2022-06-17 19:30:36 -0400 |
| commit | 76bb035b4755454150e1ae089a0b2331e40fa723 (patch) | |
| tree | a25fbe2e2d8b282ecfb939bb93731b41a064b24f /numpy/lib/arraysetops.py | |
| parent | 43b4dafd6fb96535520cccf36d39ed5cb9446177 (diff) | |
| download | numpy-76bb035b4755454150e1ae089a0b2331e40fa723.tar.gz | |
DOC: Fix formatting issues in docstring
Diffstat (limited to 'numpy/lib/arraysetops.py')
| -rw-r--r-- | numpy/lib/arraysetops.py | 6 |
1 files changed, 2 insertions, 4 deletions
diff --git a/numpy/lib/arraysetops.py b/numpy/lib/arraysetops.py index 8ced2f6d9..8af8c8803 100644 --- a/numpy/lib/arraysetops.py +++ b/numpy/lib/arraysetops.py @@ -549,7 +549,6 @@ def in1d(ar1, ar2, assume_unique=False, invert=False, kind=None): The algorithm to use. This will not affect the final result, but will affect the speed. Default will select automatically based on memory considerations. - - If 'mergesort', will use a mergesort-based approach. This will have a memory usage of roughly 6 times the sum of the sizes of `ar1` and `ar2`, not accounting for size of dtypes. @@ -565,7 +564,7 @@ def in1d(ar1, ar2, assume_unique=False, invert=False, kind=None): 6 times the sum of the sizes of `ar1` and `ar2`, otherwise will use 'mergesort'. This is done to not use a large amount of memory by default, even though - 'dictionary' may be faster in most cases. + 'dictionary' may be faster in most cases. .. versionadded:: 1.8.0 @@ -763,7 +762,6 @@ def isin(element, test_elements, assume_unique=False, invert=False, The algorithm to use. This will not affect the final result, but will affect the speed. Default will select automatically based on memory considerations. - - If 'mergesort', will use a mergesort-based approach. This will have a memory usage of roughly 6 times the sum of the sizes of `ar1` and `ar2`, not accounting for size of dtypes. @@ -779,7 +777,7 @@ def isin(element, test_elements, assume_unique=False, invert=False, 6 times the sum of the sizes of `ar1` and `ar2`, otherwise will use 'mergesort'. This is done to not use a large amount of memory by default, even though - 'dictionary' may be faster in most cases. + 'dictionary' may be faster in most cases. Returns |