Update to 2.7.3

[profile/ivi/python.git] / Doc / library / bisect.rst

diff --git a/Doc/library/bisect.rst b/Doc/library/bisect.rst
index 48cb331..27ab526 100644 (file)
--- a/Doc/library/bisect.rst
+++ b/Doc/library/bisect.rst
@@ -7,6 +7,12 @@
 .. sectionauthor:: Raymond Hettinger <python at rcn.com>
 .. example based on the PyModules FAQ entry by Aaron Watters <arw@pythonpros.com>
 
+.. versionadded:: 2.1
+
+**Source code:** :source:`Lib/bisect.py`
+
+--------------
+
 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
@@ -14,13 +20,6 @@ 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!).
 
-.. versionadded:: 2.1
-
-.. seealso::
-
-   Latest version of the `bisect module Python source code
-   <http://svn.python.org/view/python/branches/release27-maint/Lib/bisect.py?view=markup>`_
-
 The following functions are provided: