diff options
| author | Zackery Spytz <zspytz@gmail.com> | 2022-02-14 16:16:49 (GMT) |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2022-02-14 16:16:49 (GMT) |
| commit | 96084f4256d2d523b0a4d7d900322b032326e3ed (patch) | |
| tree | 580e417418a6545ce8dd24300fce5539b19c32dd /Doc/library/bisect.rst | |
| parent | 0ade875ebe0d83709ec338616d6abe439c81f29b (diff) | |
| download | cpython-96084f4256d2d523b0a4d7d900322b032326e3ed.zip cpython-96084f4256d2d523b0a4d7d900322b032326e3ed.tar.gz cpython-96084f4256d2d523b0a4d7d900322b032326e3ed.tar.bz2 | |
bpo-46747: Add missing key parameters in the bisect docs (GH-31323)
Added *key* parameter to `bisect.bisect()` and `bisect.insort()` in bisect module docs.
Diffstat (limited to 'Doc/library/bisect.rst')
| -rw-r--r-- | Doc/library/bisect.rst | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/Doc/library/bisect.rst b/Doc/library/bisect.rst index f34ee17..edcd4ae 100644 --- a/Doc/library/bisect.rst +++ b/Doc/library/bisect.rst @@ -43,7 +43,7 @@ The following functions are provided: .. function:: bisect_right(a, x, lo=0, hi=len(a), *, key=None) - bisect(a, x, lo=0, hi=len(a)) + bisect(a, x, lo=0, hi=len(a), *, key=None) Similar to :func:`bisect_left`, but returns an insertion point which comes after (to the right of) any existing entries of *x* in *a*. @@ -80,7 +80,7 @@ The following functions are provided: .. function:: insort_right(a, x, lo=0, hi=len(a), *, key=None) - insort(a, x, lo=0, hi=len(a)) + insort(a, x, lo=0, hi=len(a), *, key=None) Similar to :func:`insort_left`, but inserting *x* in *a* after any existing entries of *x*. |