2007-08-15 11:28:22 -03:00
|
|
|
|
|
|
|
|
:mod:`bisect` --- Array bisection algorithm
|
|
|
|
|
===========================================
|
|
|
|
|
|
|
|
|
|
.. module:: bisect
|
|
|
|
|
:synopsis: Array bisection algorithms for binary searching.
|
|
|
|
|
.. sectionauthor:: Fred L. Drake, Jr. <fdrake@acm.org>
|
Merged revisions 59605-59624 via svnmerge from
svn+ssh://pythondev@svn.python.org/python/trunk
........
r59606 | georg.brandl | 2007-12-29 11:57:00 +0100 (Sat, 29 Dec 2007) | 2 lines
Some cleanup in the docs.
........
r59611 | martin.v.loewis | 2007-12-29 19:49:21 +0100 (Sat, 29 Dec 2007) | 2 lines
Bug #1699: Define _BSD_SOURCE only on OpenBSD.
........
r59612 | raymond.hettinger | 2007-12-29 23:09:34 +0100 (Sat, 29 Dec 2007) | 1 line
Simpler documentation for itertools.tee(). Should be backported.
........
r59613 | raymond.hettinger | 2007-12-29 23:16:24 +0100 (Sat, 29 Dec 2007) | 1 line
Improve docs for itertools.groupby(). The use of xrange(0) to create a unique object is less obvious than object().
........
r59620 | christian.heimes | 2007-12-31 15:47:07 +0100 (Mon, 31 Dec 2007) | 3 lines
Added wininst-9.0.exe executable for VS 2008
Integrated bdist_wininst into PCBuild9 directory
........
r59621 | christian.heimes | 2007-12-31 15:51:18 +0100 (Mon, 31 Dec 2007) | 1 line
Moved PCbuild directory to PC/VS7.1
........
r59622 | christian.heimes | 2007-12-31 15:59:26 +0100 (Mon, 31 Dec 2007) | 1 line
Fix paths for build bot
........
r59623 | christian.heimes | 2007-12-31 16:02:41 +0100 (Mon, 31 Dec 2007) | 1 line
Fix paths for build bot, part 2
........
r59624 | christian.heimes | 2007-12-31 16:18:55 +0100 (Mon, 31 Dec 2007) | 1 line
Renamed PCBuild9 directory to PCBuild
........
2007-12-31 12:14:33 -04:00
|
|
|
.. example based on the PyModules FAQ entry by Aaron Watters <arw@pythonpros.com>
|
2007-08-15 11:28:22 -03:00
|
|
|
|
|
|
|
|
This module provides support for maintaining a list in sorted order without
|
|
|
|
|
having to sort the list after each insertion. For long lists of items with
|
|
|
|
|
expensive comparison operations, this can be an improvement over the more common
|
|
|
|
|
approach. The module is called :mod:`bisect` because it uses a basic bisection
|
|
|
|
|
algorithm to do its work. The source code may be most useful as a working
|
|
|
|
|
example of the algorithm (the boundary conditions are already right!).
|
|
|
|
|
|
|
|
|
|
The following functions are provided:
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
.. function:: bisect_left(list, item[, lo[, hi]])
|
|
|
|
|
|
|
|
|
|
Locate the proper insertion point for *item* in *list* to maintain sorted order.
|
|
|
|
|
The parameters *lo* and *hi* may be used to specify a subset of the list which
|
|
|
|
|
should be considered; by default the entire list is used. If *item* is already
|
|
|
|
|
present in *list*, the insertion point will be before (to the left of) any
|
|
|
|
|
existing entries. The return value is suitable for use as the first parameter
|
|
|
|
|
to ``list.insert()``. This assumes that *list* is already sorted.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
.. function:: bisect_right(list, item[, lo[, hi]])
|
|
|
|
|
|
|
|
|
|
Similar to :func:`bisect_left`, but returns an insertion point which comes after
|
|
|
|
|
(to the right of) any existing entries of *item* in *list*.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
.. function:: bisect(...)
|
|
|
|
|
|
|
|
|
|
Alias for :func:`bisect_right`.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
.. function:: insort_left(list, item[, lo[, hi]])
|
|
|
|
|
|
|
|
|
|
Insert *item* in *list* in sorted order. This is equivalent to
|
|
|
|
|
``list.insert(bisect.bisect_left(list, item, lo, hi), item)``. This assumes
|
|
|
|
|
that *list* is already sorted.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
.. function:: insort_right(list, item[, lo[, hi]])
|
|
|
|
|
|
|
|
|
|
Similar to :func:`insort_left`, but inserting *item* in *list* after any
|
|
|
|
|
existing entries of *item*.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
.. function:: insort(...)
|
|
|
|
|
|
|
|
|
|
Alias for :func:`insort_right`.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Examples
|
|
|
|
|
--------
|
|
|
|
|
|
|
|
|
|
.. _bisect-example:
|
|
|
|
|
|
|
|
|
|
The :func:`bisect` function is generally useful for categorizing numeric data.
|
|
|
|
|
This example uses :func:`bisect` to look up a letter grade for an exam total
|
|
|
|
|
(say) based on a set of ordered numeric breakpoints: 85 and up is an 'A', 75..84
|
|
|
|
|
is a 'B', etc. ::
|
|
|
|
|
|
|
|
|
|
>>> grades = "FEDCBA"
|
|
|
|
|
>>> breakpoints = [30, 44, 66, 75, 85]
|
|
|
|
|
>>> from bisect import bisect
|
|
|
|
|
>>> def grade(total):
|
|
|
|
|
... return grades[bisect(breakpoints, total)]
|
|
|
|
|
...
|
|
|
|
|
>>> grade(66)
|
|
|
|
|
'C'
|
|
|
|
|
>>> map(grade, [33, 99, 77, 44, 12, 88])
|
|
|
|
|
['E', 'A', 'B', 'D', 'F', 'A']
|
|
|
|
|
|
|
|
|
|
|
