[Python-checkins] r54665 - python/branches/release25-maint/Lib/bisect.py

[raymond.hettinger]

Author: raymond.hettinger
Date: Tue Apr  3 02:01:09 2007
New Revision: 54665

Modified:
   python/branches/release25-maint/Lib/bisect.py
Log:
SF 1602378 Clarify docstrings for bisect

Modified: python/branches/release25-maint/Lib/bisect.py
==============================================================================
--- python/branches/release25-maint/Lib/bisect.py	(original)
+++ python/branches/release25-maint/Lib/bisect.py	Tue Apr  3 02:01:09 2007
@@ -23,8 +23,8 @@
     """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 @@
     """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.