• bearophile (6/7) Oct 22 2010 Benchmarks of some efficient C++ data structures (may be tagged with @se...

bearophile <bearophileHUGS lycos.com> writes:

Benchmarks of some efficient C++ data structures (may be tagged with  sealed in
D):
http://msinilo.pl/blog/?p=668

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