Provide links to Python source in a handful of

cases where the source is a generally helpful
adjunct to the docs.

diff --git a/Doc/library/ast.rst b/Doc/library/ast.rst
index 82ca6e35c1ac769115be71c66b12db8745370e86..c62094517171b744936ac309a153b07b1e665ca6 100644 (file)
--- a/Doc/library/ast.rst
+++ b/Doc/library/ast.rst
@@ -28,6 +28,11 @@ classes all inherit from :class:`ast.AST`.  An abstract syntax tree can be
 compiled into a Python code object using the built-in :func:`compile` function.
 
 
+.. seealso::
+
+   Latest version of the `ast module Python source code
+   <http://svn.python.org/view/python/branches/release27-maint/Lib/ast.py?view=markup>`_
+
 Node classes
 ------------
 

diff --git a/Doc/library/calendar.rst b/Doc/library/calendar.rst
index 2f11aadeea5051d27b797a2a7e445de25ea0acbd..30f2a9420bf42b706410f2bb5b1788b3bca65449 100644 (file)
--- a/Doc/library/calendar.rst
+++ b/Doc/library/calendar.rst
@@ -22,6 +22,10 @@ in both directions.  This matches the definition of the "proleptic Gregorian"
 calendar in Dershowitz and Reingold's book "Calendrical Calculations", where
 it's the base calendar for all computations.
 
+.. seealso::
+
+   Latest version of the `calendar module Python source code
+   <http://svn.python.org/view/python/branches/release27-maint/Lib/calendar.py?view=markup>`_
 
 .. class:: Calendar([firstweekday])
 

diff --git a/Doc/library/collections.rst b/Doc/library/collections.rst
index 7f98c591a608d98e557cca7aef44135d310bbc98..6433cd290f7ec1f74aa72c86537358567b5888ed 100644 (file)
--- a/Doc/library/collections.rst
+++ b/Doc/library/collections.rst
@@ -44,6 +44,10 @@ In addition to containers, the collections module provides some ABCs
 provides a particular interface, for example, whether it is hashable or
 a mapping.
 
+.. seealso::
+
+   Latest version of the `collections module Python source code
+   <http://svn.python.org/view/python/branches/release27-maint/Lib/collections.py?view=markup>`_
 
 :class:`Counter` objects
 ------------------------
@@ -970,6 +974,9 @@ Notes on using :class:`Set` and :class:`MutableSet` as a mixin:
 
 .. seealso::
 
+   * Latest version of the `Python source code for the collections abstract base classes
+     <http://svn.python.org/view/python/branches/release27-maint/Lib/_abcoll.py?view=markup>`_
+
    * `OrderedSet recipe <http://code.activestate.com/recipes/576694/>`_ for an
      example built on :class:`MutableSet`.
 

diff --git a/Doc/library/queue.rst b/Doc/library/queue.rst
index 4caa1bd0b359cebfec5bb05ec4f8212335f42c3d..4a00d0bcf95be3029dcd04a2403e3e9e0b5f2d33 100644 (file)
--- a/Doc/library/queue.rst
+++ b/Doc/library/queue.rst
@@ -24,6 +24,11 @@ the first retrieved (operating like a stack).  With a priority queue,
 the entries are kept sorted (using the :mod:`heapq` module) and the
 lowest valued entry is retrieved first.
 
+.. seealso::
+
+   Latest version of the `queue module Python source code
+   <http://svn.python.org/view/python/branches/release27-maint/Lib/queue.py?view=markup>`_
+
 The :mod:`Queue` module defines the following classes and exceptions:
 
 .. class:: Queue(maxsize=0)

diff --git a/Doc/library/random.rst b/Doc/library/random.rst
index 935d60583ea2a6ba28117886503290ca7beb2bfe..4306911dfc2b1a367a9809fbd415ad83fe5f3b40 100644 (file)
--- a/Doc/library/random.rst
+++ b/Doc/library/random.rst
@@ -9,6 +9,11 @@
 This module implements pseudo-random number generators for various
 distributions.
 
+.. seealso::
+
+   Latest version of the `random module Python source code
+   <http://svn.python.org/view/python/branches/release27-maint/Lib/random.py?view=markup>`_
+
 For integers, uniform selection from a range. For sequences, uniform selection
 of a random element, a function to generate a random permutation of a list
 in-place, and a function for random sampling without replacement.

diff --git a/Doc/library/textwrap.rst b/Doc/library/textwrap.rst
index a2db567fb5bebbcf020884b2328499ae2617dace..bfc63fb4c22cf37cb9125839128ea86500010f5b 100644 (file)
--- a/Doc/library/textwrap.rst
+++ b/Doc/library/textwrap.rst
@@ -16,6 +16,10 @@ and a utility function  :func:`dedent`.  If you're just wrapping or filling one
 or two  text strings, the convenience functions should be good enough;
 otherwise,  you should use an instance of :class:`TextWrapper` for efficiency.
 
+.. seealso::
+
+   Latest version of the `textwrap module Python source code
+   <http://svn.python.org/view/python/branches/release27-maint/Lib/textwrap.py?view=markup>`_
 
 .. function:: wrap(text[, width[, ...]])
 

diff --git a/Doc/library/threading.rst b/Doc/library/threading.rst
index 2028f8b4747623b11f468a3a12cb2377d5989b39..b22d3d12e6b2dfe498e6996dcdaa9f13e92414ff 100644 (file)
--- a/Doc/library/threading.rst
+++ b/Doc/library/threading.rst
@@ -26,6 +26,10 @@ The :mod:`dummy_threading` module is provided for situations where
    Starting with Python 2.5, several Thread methods raise :exc:`RuntimeError`
    instead of :exc:`AssertionError` if called erroneously.
 
+.. seealso::
+
+   Latest version of the `threading module Python source code
+   <http://svn.python.org/view/python/branches/release27-maint/Lib/threading.py?view=markup>`_
 
 This module defines the following functions and objects:
 

diff --git a/Doc/library/userdict.rst b/Doc/library/userdict.rst
index 9ddfde5265794aad49a176dc9a01de6cd8def53d..ab9ab042761ea5aad1bdf90a5d0743d7457b58f7 100644 (file)
--- a/Doc/library/userdict.rst
+++ b/Doc/library/userdict.rst
@@ -19,6 +19,11 @@ available starting with Python version 2.2).  Prior to the introduction of
 sub-classes that obtained new behaviors by overriding existing methods or adding
 new ones.
 
+.. seealso::
+
+   Latest version of the `UserDict Python source code
+   <http://svn.python.org/view/python/branches/release27-maint/Lib/UserDict.py?view=markup>`_
+
 The :mod:`UserDict` module defines the :class:`UserDict` class and
 :class:`DictMixin`: