From 3c67d133434357645e99e947cc3b3d3e269c13ac Mon Sep 17 00:00:00 2001 From: Thomas Kemmer Date: Tue, 8 May 2018 12:41:25 +0200 Subject: [PATCH] Fix #83: Improve documentation of replacement strategy. --- docs/index.rst | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/docs/index.rst b/docs/index.rst index fe05736..0a2547e 100644 --- a/docs/index.rst +++ b/docs/index.rst @@ -30,9 +30,9 @@ different cache algorithms. All these classes derive from class :class:`Cache`, which in turn derives from :class:`collections.MutableMapping`, and provide :attr:`maxsize` and :attr:`currsize` properties to retrieve the maximum and current size -of the cache. When a cache is full, :meth:`setitem` calls -:meth:`popitem` repeatedly until there is enough room for the item to -be added. +of the cache. When a cache is full, :meth:`Cache.__setitem__()` calls +:meth:`self.popitem()` repeatedly until there is enough room for the +item to be added. All cache classes accept an optional `missing` keyword argument in their constructor, which can be used to provide a default *factory