alt Hacker NewsIf you are willing to sacrifice performance, you can implement dicts via linear lookup in much less code than a proper hash table.
Replies
FridgeSeal • today at 2:40 AM
It’s Python, you’ve already sacrificed performance, what a little bit more?
➕ show 1 reply
Because Python dicts guarantee iteration order is the same as insertion order (https://docs.python.org/3.7/library/stdtypes.html#typesmappi...) Python dicts aren’t just proper hash tables.
Because of that it wouldn’t surprise me much if that sped up some standard benchmarks, for example ones parsing lots of small json objects into dictionaries.