diff options
| author | Allen Guo <guoguo12@gmail.com> | 2020-05-12 22:54:18 (GMT) |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2020-05-12 22:54:18 (GMT) |
| commit | 3d54211e6eddc2f2586b9a20543754947c7ad325 (patch) | |
| tree | bd3460952b0d3b22cccc3165e773e5d6aa5d4308 | |
| parent | d6b727e2c947240804b8e434b305ba2890122550 (diff) | |
| download | cpython-3d54211e6eddc2f2586b9a20543754947c7ad325.zip cpython-3d54211e6eddc2f2586b9a20543754947c7ad325.tar.gz cpython-3d54211e6eddc2f2586b9a20543754947c7ad325.tar.bz2 | |
Fix Wikipedia link (GH-20031)
| -rw-r--r-- | Doc/library/functools.rst | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/Doc/library/functools.rst b/Doc/library/functools.rst index 204e66a..a44eb85 100644 --- a/Doc/library/functools.rst +++ b/Doc/library/functools.rst @@ -158,11 +158,11 @@ The :mod:`functools` module defines the following functions: bypassing the cache, or for rewrapping the function with a different cache. An `LRU (least recently used) cache - <https://en.wikipedia.org/wiki/Cache_algorithms#Examples>`_ works - best when the most recent calls are the best predictors of upcoming calls (for - example, the most popular articles on a news server tend to change each day). - The cache's size limit assures that the cache does not grow without bound on - long-running processes such as web servers. + <https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)>`_ + works best when the most recent calls are the best predictors of upcoming + calls (for example, the most popular articles on a news server tend to + change each day). The cache's size limit assures that the cache does not + grow without bound on long-running processes such as web servers. In general, the LRU cache should only be used when you want to reuse previously computed values. Accordingly, it doesn't make sense to cache |