mirror of https://github.com/python/cpython
gh-118671: Updated dead ActiveState links (#118730)
Co-authored-by: blurb-it[bot] <43283697+blurb-it[bot]@users.noreply.github.com> Co-authored-by: Kirill Podoprigora <kirill.bast9@mail.ru>
This commit is contained in:
parent
fcf52d7cee
commit
c4f9823be2
|
@ -594,5 +594,5 @@ This document was reviewed and revised by John Lee.
|
|||
scripts with a localhost server, I have to prevent urllib from using
|
||||
the proxy.
|
||||
.. [#] urllib opener for SSL proxy (CONNECT method): `ASPN Cookbook Recipe
|
||||
<https://code.activestate.com/recipes/456195/>`_.
|
||||
<https://code.activestate.com/recipes/456195-urrlib2-opener-for-ssl-proxy-connect-method/>`_.
|
||||
|
||||
|
|
|
@ -134,7 +134,7 @@ The class can be used to simulate nested scopes and is useful in templating.
|
|||
:attr:`~collections.ChainMap.parents` property.
|
||||
|
||||
* The `Nested Contexts recipe
|
||||
<https://code.activestate.com/recipes/577434/>`_ has options to control
|
||||
<https://code.activestate.com/recipes/577434-nested-contexts-a-chain-of-mapping-objects/>`_ has options to control
|
||||
whether writes and other mutations apply only to the first mapping or to
|
||||
any mapping in the chain.
|
||||
|
||||
|
|
|
@ -631,7 +631,7 @@ If you want to know how to change the first sequence into the second, use
|
|||
work.
|
||||
|
||||
* `Simple version control recipe
|
||||
<https://code.activestate.com/recipes/576729/>`_ for a small application
|
||||
<https://code.activestate.com/recipes/576729-simple-version-control/>`_ for a small application
|
||||
built with :class:`SequenceMatcher`.
|
||||
|
||||
|
||||
|
|
|
@ -134,7 +134,7 @@ Number-theoretic and representation functions
|
|||
|
||||
For further discussion and two alternative approaches, see the `ASPN cookbook
|
||||
recipes for accurate floating point summation
|
||||
<https://code.activestate.com/recipes/393090/>`_\.
|
||||
<https://code.activestate.com/recipes/393090-binary-floating-point-summation-accurate-to-full-p/>`_\.
|
||||
|
||||
|
||||
.. function:: gcd(*integers)
|
||||
|
|
|
@ -55,7 +55,7 @@ from sources provided by the operating system.
|
|||
|
||||
|
||||
`Complementary-Multiply-with-Carry recipe
|
||||
<https://code.activestate.com/recipes/576707/>`_ for a compatible alternative
|
||||
<https://code.activestate.com/recipes/576707-long-period-random-number-generator/>`_ for a compatible alternative
|
||||
random number generator with a long period and comparatively simple update
|
||||
operations.
|
||||
|
||||
|
|
|
@ -86,7 +86,7 @@ Two additional methods are supported:
|
|||
|
||||
.. seealso::
|
||||
|
||||
`Persistent dictionary recipe <https://code.activestate.com/recipes/576642/>`_
|
||||
`Persistent dictionary recipe <https://code.activestate.com/recipes/576642-persistent-dict-with-multiple-standard-file-format/>`_
|
||||
with widely supported storage formats and having the speed of native
|
||||
dictionaries.
|
||||
|
||||
|
|
|
@ -1496,7 +1496,7 @@ objects that compare equal might have different :attr:`~range.start`,
|
|||
|
||||
.. seealso::
|
||||
|
||||
* The `linspace recipe <https://code.activestate.com/recipes/579000/>`_
|
||||
* The `linspace recipe <https://code.activestate.com/recipes/579000-equally-spaced-numbers-linspace/>`_
|
||||
shows how to implement a lazy version of range suitable for floating
|
||||
point applications.
|
||||
|
||||
|
|
|
@ -877,7 +877,7 @@ always available.
|
|||
additional garbage collector overhead if the object is managed by the garbage
|
||||
collector.
|
||||
|
||||
See `recursive sizeof recipe <https://code.activestate.com/recipes/577504/>`_
|
||||
See `recursive sizeof recipe <https://code.activestate.com/recipes/577504-compute-memory-footprint-of-an-object-and-its-cont/>`_
|
||||
for an example of using :func:`getsizeof` recursively to find the size of
|
||||
containers and all their contents.
|
||||
|
||||
|
|
|
@ -785,8 +785,8 @@ functools
|
|||
|
||||
(Contributed by Raymond Hettinger and incorporating design ideas from Jim
|
||||
Baker, Miki Tebeka, and Nick Coghlan; see `recipe 498245
|
||||
<https://code.activestate.com/recipes/498245/>`_\, `recipe 577479
|
||||
<https://code.activestate.com/recipes/577479/>`_\, :issue:`10586`, and
|
||||
<https://code.activestate.com/recipes/498245-lru-and-lfu-cache-decorators/>`_\, `recipe 577479
|
||||
<https://code.activestate.com/recipes/577479-simple-caching-decorator/>`_\, :issue:`10586`, and
|
||||
:issue:`10593`.)
|
||||
|
||||
* The :func:`functools.wraps` decorator now adds a :attr:`__wrapped__` attribute
|
||||
|
|
|
@ -657,7 +657,7 @@ class MathTests(unittest.TestCase):
|
|||
def msum(iterable):
|
||||
"""Full precision summation. Compute sum(iterable) without any
|
||||
intermediate accumulation of error. Based on the 'lsum' function
|
||||
at http://code.activestate.com/recipes/393090/
|
||||
at https://code.activestate.com/recipes/393090-binary-floating-point-summation-accurate-to-full-p/
|
||||
|
||||
"""
|
||||
tmant, texp = 0, 0
|
||||
|
|
|
@ -1253,7 +1253,7 @@ FUNC1(tanh, tanh, 0,
|
|||
"Return the hyperbolic tangent of x.")
|
||||
|
||||
/* Precision summation function as msum() by Raymond Hettinger in
|
||||
<http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/393090>,
|
||||
<https://code.activestate.com/recipes/393090-binary-floating-point-summation-accurate-to-full-p/>,
|
||||
enhanced with the exact partials sum and roundoff from Mark
|
||||
Dickinson's post at <http://bugs.python.org/file10357/msum4.py>.
|
||||
See those links for more details, proofs and other references.
|
||||
|
|
|
@ -18,7 +18,7 @@ def strongly_connected_components(
|
|||
exactly once; vertices not part of a SCC are returned as
|
||||
singleton sets.
|
||||
|
||||
From http://code.activestate.com/recipes/578507/.
|
||||
From https://code.activestate.com/recipes/578507-strongly-connected-components-of-a-directed-graph/.
|
||||
"""
|
||||
identified: Set[str] = set()
|
||||
stack: List[str] = []
|
||||
|
@ -81,7 +81,7 @@ def topsort(
|
|||
{B, C}
|
||||
{A}
|
||||
|
||||
From http://code.activestate.com/recipes/577413/.
|
||||
From https://code.activestate.com/recipes/577413-topological-sort/history/1/.
|
||||
"""
|
||||
# TODO: Use a faster algorithm?
|
||||
for k, v in data.items():
|
||||
|
|
Loading…
Reference in New Issue