diff options
| author | Georg Brandl <georg@python.org> | 2016-02-26 18:37:12 (GMT) |
|---|---|---|
| committer | Georg Brandl <georg@python.org> | 2016-02-26 18:37:12 (GMT) |
| commit | 5d9413404017a829aa5ddb52be6019fb63ec5c09 (patch) | |
| tree | 75b750d4224ada300bdd242b3e08c2120681aad6 /Doc/library/itertools.rst | |
| parent | 06871ef2b31bc6d7398388fbe83816edde5c0392 (diff) | |
| download | cpython-5d9413404017a829aa5ddb52be6019fb63ec5c09.zip cpython-5d9413404017a829aa5ddb52be6019fb63ec5c09.tar.gz cpython-5d9413404017a829aa5ddb52be6019fb63ec5c09.tar.bz2 | |
Closes #25910: fix dead and permanently redirected links in the docs. Thanks to SilentGhost for the patch.
Diffstat (limited to 'Doc/library/itertools.rst')
| -rw-r--r-- | Doc/library/itertools.rst | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/Doc/library/itertools.rst b/Doc/library/itertools.rst index 8c7592d..9dac5e1 100644 --- a/Doc/library/itertools.rst +++ b/Doc/library/itertools.rst @@ -117,7 +117,7 @@ loops that truncate the stream. :func:`min` for a running minimum, :func:`max` for a running maximum, or :func:`operator.mul` for a running product. Amortization tables can be built by accumulating interest and applying payments. First-order - `recurrence relations <http://en.wikipedia.org/wiki/Recurrence_relation>`_ + `recurrence relations <https://en.wikipedia.org/wiki/Recurrence_relation>`_ can be modeled by supplying the initial value in the iterable and using only the accumulated total in *func* argument:: @@ -132,7 +132,7 @@ loops that truncate the stream. >>> list(accumulate(cashflows, lambda bal, pmt: bal*1.05 + pmt)) [1000, 960.0, 918.0, 873.9000000000001, 827.5950000000001] - # Chaotic recurrence relation http://en.wikipedia.org/wiki/Logistic_map + # Chaotic recurrence relation https://en.wikipedia.org/wiki/Logistic_map >>> logistic_map = lambda x, _: r * x * (1 - x) >>> r = 3.8 >>> x0 = 0.4 |