10 Dec
2012
10 Dec
'12
9:06 a.m.
On 10/12/12 01:44, Raymond Hettinger wrote:
The current memory layout for dictionaries is unnecessarily inefficient. It has a sparse table of 24-byte entries containing the hash value, key pointer, and value pointer.
Instead, the 24-byte entries should be stored in a dense table referenced by a sparse table of indices.
What minimum size and resizing factor do you propose for the entries array? Cheers, Mark.