www.digitalmars.com         C & C++   DMDScript  

digitalmars.D - Some benchmarks of efficient C++ data structures

Benchmarks of some efficient C++ data structures (may be tagged with  sealed in

From the post:

Note: couldnít find reserve/resize method for EASTL, thatís why map_grow is the
same as map_predict/grow. RDE tries to be as cache friendly as possible and
uses open addressing, so itís the most effective with small objects. When
iterating to next object means a cache miss anyway, most of its advantages is
lost, as is clearly visible for 256 byte items. Actually, for the last group,
std::map was the fastest, beating all hash_maps easily.<
Being the size of the keys statically known, a single associative array may automatically switch among the two representations according to the key size. Bye, bearophile
Oct 22 2010