3 ms·

edit: it seems like this is exactly what OrderedDict does, I presumed it's ordered by key, like std::map (red-black tree) vs. std::unordered_map (hash table) is

by exDM69 10y ago

edit: it seems like this is exactly what OrderedDict does, I presumed it's ordered by key, like std::map (red-black tree) vs. std::unordered_map (hash table) is in C++. No, this new dict implementation preserves insertion order, it's not ordered by value of the key. The motivation is to preserve the order of kwargs.

creshal 10y ago
That's exactly the way OrderedDict works too: https://docs.python.org/2/library/collections.html#collections.OrderedDict https://docs.python.org/2/library/collections.html#collectio... > An OrderedDict is a dict that remembers the order that keys were first inserted. If a new entry overwrites an existing entry, the original insertion position is left unchanged. Deleting an entry and reinserting it will move it to the end.
- exDM69 10y ago
  Oh thanks, I was mistaken. Added an edit to GP post.
deleted 10y ago
[deleted]