diff options
author | Raymond Hettinger <python@rcn.com> | 2003-05-05 21:31:51 (GMT) |
---|---|---|
committer | Raymond Hettinger <python@rcn.com> | 2003-05-05 21:31:51 (GMT) |
commit | 4887a12133e17d6b5a816aa289e96ca7764d6009 (patch) | |
tree | 07a269c753177364c8f73e8dcabbce53c78b0027 /Objects | |
parent | c7bc0b98e7cd2190a03da1a5269cdaaea711429e (diff) | |
download | cpython-4887a12133e17d6b5a816aa289e96ca7764d6009.zip cpython-4887a12133e17d6b5a816aa289e96ca7764d6009.tar.gz cpython-4887a12133e17d6b5a816aa289e96ca7764d6009.tar.bz2 |
Add notes from python-dev about readonly dictionaries.
Diffstat (limited to 'Objects')
-rw-r--r-- | Objects/dictnotes.txt | 21 |
1 files changed, 21 insertions, 0 deletions
diff --git a/Objects/dictnotes.txt b/Objects/dictnotes.txt index 46dabb7..673142c 100644 --- a/Objects/dictnotes.txt +++ b/Objects/dictnotes.txt @@ -197,3 +197,24 @@ sizes and access patterns, the user may be able to provide useful hints. cache locality, and a simplified search routine. It also eliminates the need to test for dummy entries on each probe. The preconditions for this strategy arise in symbol tables and in the builtin dictionary. + + +Readonly Dictionaries +--------------------- +Some dictionary use cases pass through a build stage and then move to a +more heavily exercised lookup stage with no further changes to the +dictionary. + +An idea that emerged on python-dev is to be able to convert a dictionary +to a read-only state. This can help prevent programming errors and also +provide knowledge that can be exploited for lookup optimization. + +The dictionary can be immediately rebuilt (eliminating dummy entries), +resized (to an appropriate level of sparseness), and the keys can be +jostled (to minimize collisions). The lookdict() routine can then +eliminate the test for dummy entries (saving about 1/4 of the time +spend in the collision resolution loop). + +An additional possibility is to insert links into the empty spaces +so that dictionary iteration can proceed in len(d) steps instead of +(mp->mask + 1) steps. |