diff options
author | Thomas Kemmer <tkemmer@computer.org> | 2014-06-17 11:08:04 +0200 |
---|---|---|
committer | Thomas Kemmer <tkemmer@computer.org> | 2014-06-17 11:08:04 +0200 |
commit | 4176a4f09384325278d8bb6fc8cd309302c893fa (patch) | |
tree | c974402796f1348667f295810f0d30e2953fb333 /README.rst | |
parent | cbd852dca59743f8f21759249c90a77b583f8834 (diff) | |
download | cachetools-4176a4f09384325278d8bb6fc8cd309302c893fa.tar.gz |
Fix typos/formatting in documentation
Diffstat (limited to 'README.rst')
-rw-r--r-- | README.rst | 8 |
1 files changed, 4 insertions, 4 deletions
@@ -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 |