Clean-up bisect docs.

Doc/library/bisect.rst

@@ -1,10 +1,10 @@
-
 :mod:`bisect` --- Array bisection algorithm
 ===========================================
 
 .. module:: bisect
    :synopsis: Array bisection algorithms for binary searching.
 .. sectionauthor:: Fred L. Drake, Jr. <fdrake@acm.org>
+.. sectionauthor:: Raymond Hettinger <python at rcn.com>
 .. example based on the PyModules FAQ entry by Aaron Watters <arw@pythonpros.com>
 
 This module provides support for maintaining a list in sorted order without
@@ -19,103 +19,111 @@ example of the algorithm (the boundary conditions are already right!).
 The following functions are provided:
 
 
-.. function:: bisect_left(list, item[, lo[, hi]])
+.. function:: bisect_left(a, x, lo=0, hi=len(a))
 
-   Locate the proper insertion point for *item* in *list* to maintain sorted order.
+   Locate the insertion point for *x* in *a* to maintain sorted order.
-   The parameters *lo* and *hi* may be used to specify a subset of the list which
+   The parameters *lo* and *hi* may be used to specify a subset of the list
-   should be considered; by default the entire list is used.  If *item* is already
+   which should be considered; by default the entire list is used.  If *x* is
-   present in *list*, the insertion point will be before (to the left of) any
+   already present in *a*, the insertion point will be before (to the left of)
-   existing entries.  The return value is suitable for use as the first parameter
+   any existing entries.  The return value is suitable for use as the first
-   to ``list.insert()``.  This assumes that *list* is already sorted.
+   parameter to ``list.insert()`` assuming that *a* is already sorted.
 
+   The returned insertion point *i* partitions the array *a* into two halves so
+   that ``all(val < x for val in a[lo:i])`` for the left side and
+   ``all(val >= x for val in a[i:hi])`` for the right side.
 
-.. function:: bisect_right(list, item[, lo[, hi]])
+.. function:: bisect_right(a, x, lo=0, hi=len(a))
-.. function:: bisect(list, item[, lo[, hi]])
+              bisect(a, x, lo=0, hi=len(a))
 
-   Similar to :func:`bisect_left`, but returns an insertion point which comes after
+   Similar to :func:`bisect_left`, but returns an insertion point which comes
-   (to the right of) any existing entries of *item* in *list*.
+   after (to the right of) any existing entries of *x* in *a*.
 
+   The returned insertion point *i* partitions the array *a* into two halves so
+   that ``all(val <= x for val in a[lo:i])`` for the left side and
+   ``all(val > x for val in a[i:hi])`` for the right side.
 
-.. function:: insort_left(list, item[, lo[, hi]])
+.. function:: insort_left(a, x, lo=0, hi=len(a))
 
-   Insert *item* in *list* in sorted order.  This is equivalent to
+   Insert *x* in *a* in sorted order.  This is equivalent to
-   ``list.insert(bisect.bisect_left(list, item, lo, hi), item)``.  This assumes
+   ``a.insert(bisect.bisect_left(a, x, lo, hi), x)`` assuming that *a* is
-   that *list* is already sorted.
+   already sorted.  Keep in mind that the O(log n) search is dominated by
+   the slow O(n) insertion step.
 
-   Also note that while the fast search step is O(log n), the slower insertion
+.. function:: insort_right(a, x, lo=0, hi=len(a))
-   step is O(n), so the overall operation is slow.
-
-.. function:: insort_right(list, item[, lo[, hi]])
               insort(a, x, lo=0, hi=len(a))
 
-   Similar to :func:`insort_left`, but inserting *item* in *list* after any
+   Similar to :func:`insort_left`, but inserting *x* in *a* after any existing
-   existing entries of *item*.
+   entries of *x*.
+
+.. seealso::
+
+   `SortedCollection recipe
+   <http://code.activestate.com/recipes/577197-sortedcollection/>`_ that uses
+   bisect to build a full-featured collection class with straight-forward search
+   methods and support for a key-function.  The keys are precomputed to save
+   unnecessary calls to the key function during searches.
 
-   Also note that while the fast search step is O(log n), the slower insertion
-   step is O(n), so the overall operation is slow.
 
 Searching Sorted Lists
 ----------------------
 
-The above :func:`bisect` functions are useful for finding insertion points, but
+The above :func:`bisect` functions are useful for finding insertion points but
-can be tricky or awkward to use for common searching tasks. The following three
+can be tricky or awkward to use for common searching tasks. The following five
 functions show how to transform them into the standard lookups for sorted
 lists::
 
-    def find(a, key):
+    def index(a, x):
-        '''Find leftmost item exact equal to the key.
+        'Locate the leftmost value exactly equal to x'
-        Raise ValueError if no such item exists.
+        i = bisect_left(a, x)
+        if i != len(a) and a[i] == x:
+            return i
+        raise ValueError
 
-        '''
+    def find_lt(a, x):
-        i = bisect_left(a, key)
+        'Find rightmost value less than x'
-        if i < len(a) and a[i] == key:
+        i = bisect_left(a, x)
+        if i:
+            return a[i-1]
+        raise ValueError
+
+    def find_le(a, x):
+        'Find rightmost value less than or equal to x'
+        i = bisect_right(a, x)
+        if i:
+            return a[i-1]
+        raise ValueError
+
+    def find_gt(a, x):
+        'Find leftmost value greater than x'
+        i = bisect_right(a, x)
+        if i != len(a):
             return a[i]
-        raise ValueError('No item found with key equal to: %r' % (key,))
+        raise ValueError
 
-    def find_le(a, key):
+    def find_ge(a, x):
-        '''Find largest item less-than or equal to key.
+        'Find leftmost item greater than or equal to x'
-        Raise ValueError if no such item exists.
+        i = bisect_left(a, x)
-        If multiple keys are equal, return the leftmost.
+        if i != len(a):
-
-        '''
-        i = bisect_left(a, key)
-        if i < len(a) and a[i] == key:
             return a[i]
-        if i == 0:
+        raise ValueError
-            raise ValueError('No item found with key at or below: %r' % (key,))
-        return a[i-1]
 
-    def find_ge(a, key):
-        '''Find smallest item greater-than or equal to key.
-        Raise ValueError if no such item exists.
-        If multiple keys are equal, return the leftmost.
-
-        '''
-        i = bisect_left(a, key)
-        if i == len(a):
-            raise ValueError('No item found with key at or above: %r' % (key,))
-        return a[i]
 
 Other Examples
 --------------
 
 .. _bisect-example:
 
-The :func:`bisect` function is generally useful for categorizing numeric data.
+The :func:`bisect` function can be useful for numeric table lookups. This
-This example uses :func:`bisect` to look up a letter grade for an exam total
+example uses :func:`bisect` to look up a letter grade for an exam score (say)
-(say) based on a set of ordered numeric breakpoints: 85 and up is an 'A', 75..84
+based on a set of ordered numeric breakpoints: 90 and up is an 'A', 80 to 89 is
-is a 'B', etc.
+a 'B', and so on::
 
-   >>> grades = "FEDCBA"
+   >>> def grade(score, breakpoints=[60, 70, 80, 90], grades='FDCBA'):
-   >>> breakpoints = [30, 44, 66, 75, 85]
+   ...     i = bisect(breakpoints, score)
-   >>> from bisect import bisect
+   ...     return grades[i]
-   >>> def grade(total):
-   ...           return grades[bisect(breakpoints, total)]
    ...
-   >>> grade(66)
+   >>> [grade(score) for score in [33, 99, 77, 70, 89, 90, 100]]
-   'C'
+   ['F', 'A', 'C', 'C', 'B', 'A', 'A']
-   >>> map(grade, [33, 99, 77, 44, 12, 88])
-   ['E', 'A', 'B', 'D', 'F', 'A']
 
 Unlike the :func:`sorted` function, it does not make sense for the :func:`bisect`
 functions to have *key* or *reversed* arguments because that would lead to an
@@ -137,9 +145,3 @@ of the record in question::
     >>> data[bisect_left(keys, 8)]
     ('yellow', 8)
 
-.. seealso::
-
-   `SortedCollection recipe
-   <http://code.activestate.com/recipes/577197-sortedcollection/>`_ that
-   encapsulates precomputed keys, allowing straight-forward insertion and
-   searching using a *key* function.