On Jan 25, 2015 2:37 PM, "Terry Reedy" <tjre...@udel.edu> wrote: > 2. the second array is a compact array of entries in insertion order, such as > > [hash, ptr to 'x', ptr to 23] > [hash, ptr to 'colour', ptr to 'red'] > [hash, ptr to the string 'y', ptr to the int 42] > > Iteration would use the compact array, making all dicts OrderedDicts. Pypy has already switched to this. It seems that on modern processors with multilevel on-chip caches, the space reduction leads to cache-miss reductions that compensate for the indirection cost.
Deletion becomes O(n) though. Has there been any investigation into how commonly deletion of keys is done?
-- https://mail.python.org/mailman/listinfo/python-list
