aboutsummaryrefslogtreecommitdiff
path: root/README.rst
diff options
context:
space:
mode:
authorThomas Kemmer <tkemmer@computer.org>2014-06-17 11:08:04 +0200
committerThomas Kemmer <tkemmer@computer.org>2014-06-17 11:08:04 +0200
commit4176a4f09384325278d8bb6fc8cd309302c893fa (patch)
treec974402796f1348667f295810f0d30e2953fb333 /README.rst
parentcbd852dca59743f8f21759249c90a77b583f8834 (diff)
downloadcachetools-4176a4f09384325278d8bb6fc8cd309302c893fa.tar.gz
Fix typos/formatting in documentation
Diffstat (limited to 'README.rst')
-rw-r--r--README.rst8
1 files changed, 4 insertions, 4 deletions
diff --git a/README.rst b/README.rst
index ac71176..4a7f5f0 100644
--- a/README.rst
+++ b/README.rst
@@ -27,10 +27,10 @@ of the cache exceeds its maximum size, the cache must choose which
item(s) to discard based on a suitable `cache algorithm`_.
In general, a cache's size is the sum of the size of its items. If
-the size of each items is ``1``, a cache's size is equal to the number
-of its items, i.e. ``len()``. An items's size may also be a property
-or function of its value, e.g. the result of ``sys.getsizeof()``, or
-``len()`` for string and sequence values.
+the size of each items is 1, a cache's size is equal to the number of
+its items, i.e. ``len(cache)``. An items's size may also be a
+property or function of its value, e.g. the result of
+``sys.getsizeof()``, or ``len()`` for string and sequence values.
This module provides various cache implementations based on different
cache algorithms, as well as decorators for easily memoizing function