38 ms·
How is the performance on this for very large dictionaries vs. standard python dictionary lookups?
by tjpaudio 9y ago
How is the performance on this for very large dictionaries vs. standard python dictionary lookups?
- johnwheeler 9y agoA really good question. I haven't looked much at the code but I'd imagine still O(1) because it's just converting the keys into a different format.
- bmh100 9y agoBut that says nothing about whether there is a constant penalty being applied.
- johnwheeler 9y agocertainly
- chris_griffith 9y agoJust finished my article that includes speed comparisons. http://www.codecalamity.com/python-box-3-the-reddit-release/#speed-and-memory-usage http://www.codecalamity.com/python-box-3-the-reddit-release/... Basically it's faster on standard soft creation as it converts on lookup. (And most use cases don't call for referencing every single key)