summaryrefslogtreecommitdiffstats
path: root/Doc/library/functools.rst
diff options
context:
space:
mode:
authorGeorg Brandl <georg@python.org>2010-07-31 10:16:21 (GMT)
committerGeorg Brandl <georg@python.org>2010-07-31 10:16:21 (GMT)
commit014e0ca58efed657ae2b6bdd724e4721967d05ef (patch)
tree1078793b2f5cfbdf48f398bcfce6071c26878ecf /Doc/library/functools.rst
parent4821ef89d4ce166c735cad48a57c03eae01fa577 (diff)
downloadcpython-014e0ca58efed657ae2b6bdd724e4721967d05ef.zip
cpython-014e0ca58efed657ae2b6bdd724e4721967d05ef.tar.gz
cpython-014e0ca58efed657ae2b6bdd724e4721967d05ef.tar.bz2
Revert r83327. This will have to wait until after the alpha1 release.
Diffstat (limited to 'Doc/library/functools.rst')
-rw-r--r--Doc/library/functools.rst51
1 files changed, 0 insertions, 51 deletions
diff --git a/Doc/library/functools.rst b/Doc/library/functools.rst
index b2d69de..a9819f2 100644
--- a/Doc/library/functools.rst
+++ b/Doc/library/functools.rst
@@ -37,57 +37,6 @@ The :mod:`functools` module defines the following functions:
.. versionadded:: 3.2
-.. decorator:: lfu_cache(maxsize)
-
- Decorator to wrap a function with a memoizing callable that saves up to the
- *maxsize* most frequent calls. It can save time when an expensive or I/O
- bound function is periodically called with the same arguments.
-
- The *maxsize* parameter defaults to 100. Since a dictionary is used to cache
- results, the positional and keyword arguments to the function must be
- hashable.
-
- The wrapped function is instrumented with two attributes, :attr:`hits`
- and :attr:`misses` which count the number of successful or unsuccessful
- cache lookups. These statistics are helpful for tuning the *maxsize*
- parameter and for measuring the cache's effectiveness.
-
- The wrapped function also has a :attr:`clear` attribute which can be
- called (with no arguments) to clear the cache.
-
- A `LFU (least frequently used) cache
- <http://en.wikipedia.org/wiki/Cache_algorithms#Least-Frequently_Used>`_
- is indicated when the pattern of calls does not change over time, when
- more the most common calls already seen are the best predictors of the
- most common upcoming calls.
-
- .. versionadded:: 3.2
-
-.. decorator:: lru_cache(maxsize)
-
- Decorator to wrap a function with a memoizing callable that saves up to the
- *maxsize* most recent calls. It can save time when an expensive or I/O bound
- function is periodically called with the same arguments.
-
- The *maxsize* parameter defaults to 100. Since a dictionary is used to cache
- results, the positional and keyword arguments to the function must be
- hashable.
-
- The wrapped function is instrumented with two attributes, :attr:`hits`
- and :attr:`misses` which count the number of successful or unsuccessful
- cache lookups. These statistics are helpful for tuning the *maxsize*
- parameter and for measuring the cache's effectiveness.
-
- The wrapped function also has a :attr:`clear` attribute which can be
- called (with no arguments) to clear the cache.
-
- A `LRU (least recently used) cache
- <http://en.wikipedia.org/wiki/Cache_algorithms#Least_Recently_Used>`_
- is indicated when the pattern of calls changes over time, such as
- when more recent calls are the best predictors of upcoming calls.
-
- .. versionadded:: 3.2
-
.. decorator:: total_ordering
Given a class defining one or more rich comparison ordering methods, this