summaryrefslogtreecommitdiffstats
path: root/Doc/faq/design.rst
diff options
context:
space:
mode:
Diffstat (limited to 'Doc/faq/design.rst')
-rw-r--r--Doc/faq/design.rst6
1 files changed, 1 insertions, 5 deletions
diff --git a/Doc/faq/design.rst b/Doc/faq/design.rst
index 2e56fbc..5d8f3a5 100644
--- a/Doc/faq/design.rst
+++ b/Doc/faq/design.rst
@@ -495,11 +495,7 @@ on the key and a per-process seed; for example, "Python" could hash to
to 1142331976. The hash code is then used to calculate a location in an
internal array where the value will be stored. Assuming that you're storing
keys that all have different hash values, this means that dictionaries take
-constant time -- O(1), in computer science notation -- to retrieve a key. It
-also means that no sorted order of the keys is maintained, and traversing the
-array as the ``.keys()`` and ``.items()`` do will output the dictionary's
-content in some arbitrary jumbled order that can change with every invocation of
-a program.
+constant time -- O(1), in computer science notation -- to retrieve a key.
Why must dictionary keys be immutable?