summaryrefslogtreecommitdiff
path: root/README.rst
diff options
context:
space:
mode:
authorYury Selivanov <yury@magic.io>2018-04-02 18:05:35 -0400
committerYury Selivanov <yury@magic.io>2018-04-02 18:05:35 -0400
commit552544080cd9a46c6be612f35b924515d998dbe9 (patch)
treee0b3038a0dc5cc0bb25a4fb19197ca229003eac2 /README.rst
parent657f076cb92e98bda97faf493c04fc9c47869d30 (diff)
downloadimmutables-552544080cd9a46c6be612f35b924515d998dbe9.tar.gz
immutables-552544080cd9a46c6be612f35b924515d998dbe9.zip
readme: Use proper big O
Diffstat (limited to 'README.rst')
-rw-r--r--README.rst6
1 files changed, 3 insertions, 3 deletions
diff --git a/README.rst b/README.rst
index 72aaf21..3c1b8a0 100644
--- a/README.rst
+++ b/README.rst
@@ -14,9 +14,9 @@ used in Clojure, Scala, Haskell, and other functional languages.
This implementation is used in CPython 3.7 in the ``contextvars``
module (see PEP 550 and PEP 567 for more details).
-Immutable mappings based on HAMT have O(log\ :sub:`32`\ N)
-performance for both ``set()`` and ``get()`` operations, which is
-essentially O(1) for relatively small mappings.
+Immutable mappings based on HAMT have O(log N) performance for both
+``set()`` and ``get()`` operations, which is essentially O(1) for
+relatively small mappings.
Below is a visualization of a simple get/set benchmark comparing
HAMT to an immutable mapping implemented with a Python dict