[Python-checkins] bpo-46747: Add missing key parameters in the bisect docs (GH-31323)

[sweeneyde]

https://github.com/python/cpython/commit/96084f4256d2d523b0a4d7d900322b032326e3ed
commit: 96084f4256d2d523b0a4d7d900322b032326e3ed
branch: main
author: Zackery Spytz <zspytz at gmail.com>
committer: sweeneyde <36520290+sweeneyde at users.noreply.github.com>
date: 2022-02-14T11:16:49-05:00
summary:

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.

files:
M Doc/library/bisect.rst

diff --git a/Doc/library/bisect.rst b/Doc/library/bisect.rst
index f34ee175ba657..edcd4aeb24aa7 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*.