[Python-Dev] More compact dictionaries with faster iteration
Stefan Drees
stefan at drees.name
Wed May 15 14:01:31 CEST 2013
More information about the Python-Dev mailing list
Wed May 15 14:01:31 CEST 2013
- Previous message: [Python-Dev] More compact dictionaries with faster iteration
- Next message: [Python-Dev] More compact dictionaries with faster iteration
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Hi Chris, On 15.05.13 13:32 Christian Tismer wrote: > Hi Raymond, > > On 08.01.13 15:49, Maciej Fijalkowski wrote: >> On Mon, Dec 10, 2012 at 3:44 AM, Raymond Hettinger >> <raymond.hettinger at gmail.com> 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. >>> >>> ... >> > > What is the current status of this discussion? > I'd like to know whether it is a considered alternative implementation. > > There is also a discussion in python-ideas right now where this > alternative is mentioned, and I think especially for small dicts > as **kwargs, it could be a cheap way to introduce order. > > Is this going on, somewhere? I'm quite interested on that. +1 I am also interested on the status. Many people seemed to have copied the recipe from the activestate site (was it?) but I wonder if it maybe was to cool to be progressed into "the field" or simply some understandable lack of resources? All the best, Stefan
- Previous message: [Python-Dev] More compact dictionaries with faster iteration
- Next message: [Python-Dev] More compact dictionaries with faster iteration
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Python-Dev mailing list