diff options
| author | Georg Brandl <georg@python.org> | 2007-09-01 13:51:09 (GMT) |
|---|---|---|
| committer | Georg Brandl <georg@python.org> | 2007-09-01 13:51:09 (GMT) |
| commit | 55ac8f0f26efdbbcb5cc197f9369d23d50bee908 (patch) | |
| tree | a0d5b7128c055d8c767652dc3948c3404be06396 /Doc/library/bisect.rst | |
| parent | 1617457cff847fed9fadb01f1acf6ba8bb621726 (diff) | |
| download | cpython-55ac8f0f26efdbbcb5cc197f9369d23d50bee908.zip cpython-55ac8f0f26efdbbcb5cc197f9369d23d50bee908.tar.gz cpython-55ac8f0f26efdbbcb5cc197f9369d23d50bee908.tar.bz2 | |
Get rid of the remaining versionadded/versionchanged directives.
Diffstat (limited to 'Doc/library/bisect.rst')
| -rw-r--r-- | Doc/library/bisect.rst | 8 |
1 files changed, 0 insertions, 8 deletions
diff --git a/Doc/library/bisect.rst b/Doc/library/bisect.rst index b8eb348..10f72fb 100644 --- a/Doc/library/bisect.rst +++ b/Doc/library/bisect.rst @@ -30,16 +30,12 @@ The following functions are provided: existing entries. The return value is suitable for use as the first parameter to ``list.insert()``. This assumes that *list* is already sorted. - .. versionadded:: 2.1 - .. 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*. - .. versionadded:: 2.1 - .. function:: bisect(...) @@ -52,16 +48,12 @@ The following functions are provided: ``list.insert(bisect.bisect_left(list, item, lo, hi), item)``. This assumes that *list* is already sorted. - .. versionadded:: 2.1 - .. function:: insort_right(list, item[, lo[, hi]]) Similar to :func:`insort_left`, but inserting *item* in *list* after any existing entries of *item*. - .. versionadded:: 2.1 - .. function:: insort(...) |