changeset:   100268:2d8e8d0e7162
branch:      2.7
user:        Georg Brandl <georg@python.org>
date:        Fri Feb 19 08:57:23 2016 +0100
files:       Doc/library/random.rst
description:
Closes #20169: fix inner links random doc.


diff -r 9211b7e60c92 -r 2d8e8d0e7162 Doc/library/random.rst
--- a/Doc/library/random.rst	Fri Feb 19 03:27:46 2016 +0000
+++ b/Doc/library/random.rst	Fri Feb 19 08:57:23 2016 +0100
@@ -19,7 +19,7 @@
 lognormal, negative exponential, gamma, and beta distributions. For generating
 distributions of angles, the von Mises distribution is available.
 
-Almost all module functions depend on the basic function :func:`random`, which
+Almost all module functions depend on the basic function :func:`.random`, which
 generates a random float uniformly in the semi-open range [0.0, 1.0).  Python
 uses the Mersenne Twister as the core generator.  It produces 53-bit precision
 floats and has a period of 2\*\*19937-1.  The underlying implementation in C is
@@ -36,9 +36,10 @@
 it likely that the generated sequences seen by each thread don't overlap.
 
 Class :class:`Random` can also be subclassed if you want to use a different
-basic generator of your own devising: in that case, override the :meth:`random`,
-:meth:`seed`, :meth:`getstate`, :meth:`setstate` and :meth:`jumpahead` methods.
-Optionally, a new generator can supply a :meth:`getrandbits` method --- this
+basic generator of your own devising: in that case, override the :meth:`~Random.random`,
+:meth:`~Random.seed`, :meth:`~Random.getstate`, :meth:`~Random.setstate` and
+:meth:`~Random.jumpahead` methods.  Optionally, a new generator can supply a
+:meth:`~Random.getrandbits` method --- this
 allows :meth:`randrange` to produce selections over an arbitrarily large range.
 
 .. versionadded:: 2.4
@@ -158,7 +159,7 @@
 
    Shuffle the sequence *x* in place. The optional argument *random* is a
    0-argument function returning a random float in [0.0, 1.0); by default, this is
-   the function :func:`random`.
+   the function :func:`.random`.
 
    Note that for even rather small ``len(x)``, the total number of permutations of
    *x* is larger than the period of most random number generators; this implies