[Python-Dev] Python 3.6 dict becomes compact and gets a private version; and keywords become ordered (original) (raw)
Brett Cannon brett at python.org
Mon Sep 12 18:56:39 EDT 2016
- Previous message (by thread): [Python-Dev] Python 3.6 dict becomes compact and gets a private version; and keywords become ordered
- Next message (by thread): [Python-Dev] Python 3.6 dict becomes compact and gets a private version; and keywords become ordered
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
On Mon, 12 Sep 2016 at 15:46 Ethan Furman <ethan at stoneleaf.us> wrote:
On 09/12/2016 09:27 AM, Gregory P. Smith wrote:
> For the regular dict (non kwargs or namespace dict) use case I would actually like to /see disorder preserved during iteration/. > > If we don't, we will eventually to find ourselves in a similar state we were in pre hash-randomization: Does anyone have a short explanation of the interaction between hash randomization and this new always ordered dict? Why doesn't one make the other useless?
There is still a hash table that stores a pointer into an array that stores the keys/values that are kept in an ordered array. So that first-level hash table still uses hash randomization. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://mail.python.org/pipermail/python-dev/attachments/20160912/b69086f4/attachment.html>
- Previous message (by thread): [Python-Dev] Python 3.6 dict becomes compact and gets a private version; and keywords become ordered
- Next message (by thread): [Python-Dev] Python 3.6 dict becomes compact and gets a private version; and keywords become ordered
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]