From 829b7669f070a6228bba5c7a10a05b12891a95fd Mon Sep 17 00:00:00 2001 From: "Miss Islington (bot)" <31488909+miss-islington@users.noreply.github.com> Date: Tue, 26 Jun 2018 01:47:10 -0700 Subject: [PATCH] bpo-33957: Doc: Use better wording (GH-7912) MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit (cherry picked from commit 866c168a5f9330d8a3ae109fa8baab2509f35cc7) Co-authored-by: Srinivas Reddy Thatiparthy (శ్రీనివాస్ రెడ్డి తాటిపర్తి) --- Doc/faq/design.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Doc/faq/design.rst b/Doc/faq/design.rst index edc9c12aecf..c2bf37a7a82 100644 --- a/Doc/faq/design.rst +++ b/Doc/faq/design.rst @@ -500,7 +500,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. +constant time -- O(1), in Big-O notation -- to retrieve a key. Why must dictionary keys be immutable?