summaryrefslogtreecommitdiffstats
path: root/Objects
diff options
context:
space:
mode:
authorBenjamin Peterson <benjamin@python.org>2016-09-08 17:14:31 (GMT)
committerBenjamin Peterson <benjamin@python.org>2016-09-08 17:14:31 (GMT)
commit003f059b3a4e00e24c68b45b16cdefeb38cc01aa (patch)
treed2801af323edf6bc249b23fb655e972838133db8 /Objects
parente5e3edb920e0999a2c241d435cd774fbca3291a9 (diff)
downloadcpython-003f059b3a4e00e24c68b45b16cdefeb38cc01aa.zip
cpython-003f059b3a4e00e24c68b45b16cdefeb38cc01aa.tar.gz
cpython-003f059b3a4e00e24c68b45b16cdefeb38cc01aa.tar.bz2
link to canonical blogspot
Diffstat (limited to 'Objects')
-rw-r--r--Objects/dictobject.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/Objects/dictobject.c b/Objects/dictobject.c
index 5af8c97..866a233 100644
--- a/Objects/dictobject.c
+++ b/Objects/dictobject.c
@@ -11,7 +11,7 @@
This implements the dictionary's hashtable.
As of Python 3.6, this is compact and orderd. Basic idea is described here.
-https://morepypy.blogspot.jp/2015/01/faster-more-memory-efficient-and-more.html
+https://morepypy.blogspot.com/2015/01/faster-more-memory-efficient-and-more.html
layout: