From: Sergey Golitsynskiy <sgolitsynskiy@gmail.com>
Date: Sat, 11 Jul 2020 23:18:31 +0000 (-0400)
Subject: Fix error in docstrings in bisect module (GH-21422)
X-Git-Tag: v3.10.0a1~403
X-Git-Url: http://git.ipfire.org/gitweb.cgi?a=commitdiff_plain;h=6a1e9c26736259413b060b01d1cb52fcf82c0385;p=thirdparty%2FPython%2Fcpython.git

Fix error in docstrings in bisect module (GH-21422)

The docstrings for `bisect_right()` and `bisect_left()` contain sample
code that has a bug: `a.insert(x)` should be `a.insert(i, x)`.
---

diff --git a/Lib/bisect.py b/Lib/bisect.py
index 8f3f6a3fe35f..8336a4ed9ca0 100644
--- a/Lib/bisect.py
+++ b/Lib/bisect.py
@@ -16,7 +16,7 @@ def bisect_right(a, x, lo=0, hi=None):
     """Return the index where to insert item x in list a, assuming a is sorted.
 
     The return value i is such that all e in a[:i] have e <= x, and all e in
-    a[i:] have e > x.  So if x already appears in the list, a.insert(x) will
+    a[i:] have e > x.  So if x already appears in the list, a.insert(i, x) will
     insert just after the rightmost x already there.
 
     Optional args lo (default 0) and hi (default len(a)) bound the
@@ -51,7 +51,7 @@ def bisect_left(a, x, lo=0, hi=None):
     """Return the index where to insert item x in list a, assuming a is sorted.
 
     The return value i is such that all e in a[:i] have e < x, and all e in
-    a[i:] have e >= x.  So if x already appears in the list, a.insert(x) will
+    a[i:] have e >= x.  So if x already appears in the list, a.insert(i, x) will
     insert just before the leftmost x already there.
 
     Optional args lo (default 0) and hi (default len(a)) bound the