(original) (raw)

On Mon, 12 Sep 2016 at 15:46 Ethan Furman <ethan@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.