From: Raymond Hettinger <python@rcn.com>
Date: Tue, 3 Apr 2007 00:01:09 +0000 (+0000)
Subject: SF 1602378 Clarify docstrings for bisect
X-Git-Tag: v2.5.1c1~7
X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=6a390b34b72cbffdea2115f5e2594895dbbd5c09;p=python

SF 1602378 Clarify docstrings for bisect
---

diff --git a/Lib/bisect.py b/Lib/bisect.py
index 152f6c7854..e4a21336f8 100644
--- a/Lib/bisect.py
+++ b/Lib/bisect.py
@@ -23,8 +23,8 @@ 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, i points just
-    beyond the rightmost x already there.
+    a[i:] have e > x.  So if x already appears in the list, a.insert(x) will
+    insert just after the rightmost x already there.
 
     Optional args lo (default 0) and hi (default len(a)) bound the
     slice of a to be searched.
@@ -62,8 +62,8 @@ 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, i points just
-    before the leftmost x already there.
+    a[i:] have e >= x.  So if x already appears in the list, a.insert(x) will
+    insert just before the leftmost x already there.
 
     Optional args lo (default 0) and hi (default len(a)) bound the
     slice of a to be searched.