3 ms·

Also interesting is the apparent fact that map and set (the tree-based ones) grow at faster than logarithmic time---if they were true O(lg n) then (given the lo

by blahedo 12y ago

Also interesting is the apparent fact that map and set (the tree-based ones) grow at faster than logarithmic time---if they were true O(lg n) then (given the log scale on the x axis) they should appear linear on these graphs. It would be nice to see the specific code used to run the benchmarks, though.

julian37 12y ago
The benchmark code is linked to from the article: http://svn.clifford.at/handicraft/2014/hashlib/ http://svn.clifford.at/handicraft/2014/hashlib/