diff options
| author | Georg Brandl <georg@python.org> | 2010-09-21 14:48:28 (GMT) |
|---|---|---|
| committer | Georg Brandl <georg@python.org> | 2010-09-21 14:48:28 (GMT) |
| commit | 6faee4e2ce8ee107bfe92bac74afa2c30ed4aebd (patch) | |
| tree | 2493738443750be19a421393c8b20fde0f1a195e /Doc/library/bisect.rst | |
| parent | af38dc5b0c6f4a0308555199a07fcaba8f27e94d (diff) | |
| download | cpython-6faee4e2ce8ee107bfe92bac74afa2c30ed4aebd.zip cpython-6faee4e2ce8ee107bfe92bac74afa2c30ed4aebd.tar.gz cpython-6faee4e2ce8ee107bfe92bac74afa2c30ed4aebd.tar.bz2 | |
#9911: doc copyedits.
Diffstat (limited to 'Doc/library/bisect.rst')
| -rw-r--r-- | Doc/library/bisect.rst | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Doc/library/bisect.rst b/Doc/library/bisect.rst index 8bf0949..eb23159 100644 --- a/Doc/library/bisect.rst +++ b/Doc/library/bisect.rst @@ -125,7 +125,7 @@ a 'B', and so on:: 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 -inefficent design (successive calls to bisect functions would not "remember" +inefficient design (successive calls to bisect functions would not "remember" all of the previous key lookups). Instead, it is better to search a list of precomputed keys to find the index |