Re:Crit-bit Trees: the best way to store sets
by willvarfar on Tuesday September 20, 2011 @09:15AM
(#3017376)
You weaken his rhetoric; he writes like its crit-bit all the way for all purposes.
And since there is not a queue of people complaining that Python's dict is not iterable in order, I'd say he's wrong. Random access in a dict is the most common use-case by a very long chalk.
And since there is not a queue of people complaining that Python's dict is not iterable in order, I'd say he's wrong. Random access in a dict is the most common use-case by a very long chalk.