mirrors/cpython
1
0
Fork 0
mirror of https://github.com/python/cpython.git synced 2025-10-31 10:26:02 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 10

Clean-up docstring in examples.

Browse source
This commit is contained in:
Raymond Hettinger 2010-08-07 21:31:55 +00:00
parent 0a3ddad666
commit 769b6d3009
1 changed files with 5 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

10
Doc/library/bisect.rst
View file

@ -61,7 +61,7 @@ functions show how to transform them into the standard lookups for sorted
lists:: lists::
def find(a, key): 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. Raise ValueError if no such item exists.
''' '''
@ -71,9 +71,9 @@ lists::
raise ValueError('No item found with key equal to: %r' % (key,)) raise ValueError('No item found with key equal to: %r' % (key,))
def find_le(a, 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. 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) i = bisect_left(a, key)
@ -84,9 +84,9 @@ lists::
return a[i-1] return a[i-1]
def find_ge(a, key): 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. 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) i = bisect_left(a, key)