summaryrefslogtreecommitdiffstats
path: root/Objects/dictobject.c
diff options
context:
space:
mode:
authorRaymond Hettinger <python@rcn.com>2016-10-22 16:58:14 (GMT)
committerRaymond Hettinger <python@rcn.com>2016-10-22 16:58:14 (GMT)
commitb12785d4564614c3e4331711ebbce920a22a5493 (patch)
tree74cdc2642a2716750bf18d05e01a75f7e850bdca /Objects/dictobject.c
parentf25bf43d166bc39f756d3942f0d7675963459ed8 (diff)
downloadcpython-b12785d4564614c3e4331711ebbce920a22a5493.zip
cpython-b12785d4564614c3e4331711ebbce920a22a5493.tar.gz
cpython-b12785d4564614c3e4331711ebbce920a22a5493.tar.bz2
Reference the original compact-and-ordered proposal
Diffstat (limited to 'Objects/dictobject.c')
-rw-r--r--Objects/dictobject.c5
1 files changed, 3 insertions, 2 deletions
diff --git a/Objects/dictobject.c b/Objects/dictobject.c
index 03c973b..2cca2c6 100644
--- a/Objects/dictobject.c
+++ b/Objects/dictobject.c
@@ -10,8 +10,9 @@
This implements the dictionary's hashtable.
-As of Python 3.6, this is compact and ordered. Basic idea is described here.
-https://morepypy.blogspot.com/2015/01/faster-more-memory-efficient-and-more.html
+As of Python 3.6, this is compact and ordered. Basic idea is described here:
+* https://mail.python.org/pipermail/python-dev/2012-December/123028.html
+* https://morepypy.blogspot.com/2015/01/faster-more-memory-efficient-and-more.html
layout: