[Python-checkins] r83784 - python/branches/py3k/Doc/library/bisect.rst

raymond.hettinger python-checkins at python.org
Sat Aug 7 23:31:55 CEST 2010


Author: raymond.hettinger
Date: Sat Aug  7 23:31:55 2010
New Revision: 83784

Log:
Clean-up docstring in examples.

Modified:
   python/branches/py3k/Doc/library/bisect.rst

Modified: python/branches/py3k/Doc/library/bisect.rst
==============================================================================
--- python/branches/py3k/Doc/library/bisect.rst	(original)
+++ python/branches/py3k/Doc/library/bisect.rst	Sat Aug  7 23:31:55 2010
@@ -61,7 +61,7 @@
 lists::
 
     def find(a, key):
-        '''Find item with a key-value equal to key.
+        '''Find leftmost item exact equal to the key.
         Raise ValueError if no such item exists.
 
         '''
@@ -71,9 +71,9 @@
         raise ValueError('No item found with key equal to: %r' % (key,))
 
     def find_le(a, key):
-        '''Find largest item with a key-value less-than or equal to key.
+        '''Find largest item less-than or equal to key.
         Raise ValueError if no such item exists.
-        If multiple key-values are equal, return the leftmost.
+        If multiple keys are equal, return the leftmost.
 
         '''
         i = bisect_left(a, key)
@@ -84,9 +84,9 @@
         return a[i-1]
 
     def find_ge(a, key):
-        '''Find smallest item with a key-value greater-than or equal to key.
+        '''Find smallest item greater-than or equal to key.
         Raise ValueError if no such item exists.
-        If multiple key-values are equal, return the leftmost.
+        If multiple keys are equal, return the leftmost.
 
         '''
         i = bisect_left(a, key)


More information about the Python-checkins mailing list