From c4aa5d8356c0f76550d17b27f034c2c19ffc1767 Mon Sep 17 00:00:00 2001 From: MilesCranmer Date: Wed, 22 Jun 2022 16:57:52 -0400 Subject: DOC: Rephrase docstring of in1d/isin --- 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 5d187cf07..e10700785 100644 --- a/numpy/lib/arraysetops.py +++ b/numpy/lib/arraysetops.py @@ -553,7 +553,7 @@ def in1d(ar1, ar2, assume_unique=False, invert=False, *, kind=None): * If 'sort', 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. - * If 'table', will use a key-dictionary approach similar + * If 'table', will use a lookup table approach similar to a counting sort. This is only available for boolean and integer arrays. This will have a memory usage of the size of `ar1` plus the max-min value of `ar2`. `assume_unique` @@ -772,7 +772,7 @@ def isin(element, test_elements, assume_unique=False, invert=False, *, * If 'sort', 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. - * If 'table', will use a key-dictionary approach similar + * If 'table', will use a lookup table approach similar to a counting sort. This is only available for boolean and integer arrays. This will have a memory usage of the size of `ar1` plus the max-min value of `ar2`. `assume_unique` -- cgit v1.2.1