diff options
author | Thomas Kemmer <tkemmer@computer.org> | 2014-06-16 20:42:08 +0200 |
---|---|---|
committer | Thomas Kemmer <tkemmer@computer.org> | 2014-06-16 20:42:08 +0200 |
commit | e9a8c86562341f1321215aa86d2f1db06e388bc5 (patch) | |
tree | 1f5620494ac7bbd9e24c6e41d21d09622b82719f /README.rst | |
parent | b210c14c7fb336205625be8d29ece52c2fba6abe (diff) | |
download | cachetools-e9a8c86562341f1321215aa86d2f1db06e388bc5.tar.gz |
Remove Sphinx markup
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 :const:`1`, a cache's size is equal to the -number of its items, i.e. :func:`len`. An items's size may also be a -property or function of its value, e.g. the result of -:func:`sys.getsizeof`, or :func:`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`. 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 |