aboutsummaryrefslogtreecommitdiff
path: root/README.rst
diff options
context:
space:
mode:
authorThomas Kemmer <tkemmer@computer.org>2014-06-16 20:43:26 +0200
committerThomas Kemmer <tkemmer@computer.org>2014-06-16 20:43:26 +0200
commite78228cf488219044e71f98de630a0b07e35b293 (patch)
treeed8f844d3ea4334c0367c89cb38a400ac5556446 /README.rst
parente9a8c86562341f1321215aa86d2f1db06e388bc5 (diff)
downloadcachetools-e78228cf488219044e71f98de630a0b07e35b293.tar.gz
Remove Sphinx markup
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 25d3381..85b3596 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()``. 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