Re:Box: Python dictionaries with recursive dot notation access
by tjpaudio on Friday May 05, 2017 @11:34AM
(#14274186)
How is the performance on this for very large dictionaries vs. standard python dictionary lookups?
[ Parent
| on HN ]
Re:Box: Python dictionaries with recursive dot notation access
by chris_griffith on Friday May 05, 2017 @02:08PM
(#14275522)
Just finished my article that includes speed comparisons. 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)
Re:Box: Python dictionaries with recursive dot notation access
by johnwheeler on Friday May 05, 2017 @11:40AM
(#14274227)
A 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.
Re:Box: Python dictionaries with recursive dot notation access
by bmh100 on Friday May 05, 2017 @12:20PM
(#14274594)
But that says nothing about whether there is a constant penalty being applied.
Re:Box: Python dictionaries with recursive dot notation access
by johnwheeler on Tuesday May 09, 2017 @11:58AM
(#14301110)
certainly