summaryrefslogtreecommitdiff
path: root/Objects/odictobject.c
diff options
context:
space:
mode:
authorBenjamin Peterson <benjamin@python.org>2016-09-08 11:08:30 -0700
committerBenjamin Peterson <benjamin@python.org>2016-09-08 11:08:30 -0700
commitee178e6d6ebcf28da8696c853cc9de5e3c0f15b4 (patch)
treed88ef200f07c964eaa8e3477e311405e3f4caa55 /Objects/odictobject.c
parentb1a95888de0e007cf89a533e0845b5fadad6a49f (diff)
downloadcpython-git-ee178e6d6ebcf28da8696c853cc9de5e3c0f15b4.tar.gz
fix spelling
Diffstat (limited to 'Objects/odictobject.c')
-rw-r--r--Objects/odictobject.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/Objects/odictobject.c b/Objects/odictobject.c
index fe47098b62..4a4cd1e048 100644
--- a/Objects/odictobject.c
+++ b/Objects/odictobject.c
@@ -39,7 +39,7 @@ we've considered:
__getitem__(), get(), etc. accordingly.
The approach with the least performance impact (time and space) is #2,
-mirroring the key order of dict's dk_enties with an array of node pointers.
+mirroring the key order of dict's dk_entries with an array of node pointers.
While lookdict() and friends (dk_lookup) don't give us the index into the
array, we make use of pointer arithmetic to get that index. An alternative
would be to refactor lookdict() to provide the index, explicitly exposing