map_benchmark

map_benchmark copied to clipboard

Hello, I add the `fph::MetaFphMap` from [https://github.com/renzibei/fph-table](https://github.com/renzibei/fph-table). This map is similar to the `fph::DynamicFphMap`, but it uses metadata. So it is faster in `find` when success rate is 0% and...

renzibei

Exclude the time of inserts from the time of finds

1

The timing part of the current `find` has some issues to discuss. The time measured now includes the time used for inserts. The hash table is slowly expanded to its...

renzibei

Some notes for the big update

4

* don't split up benchmark results by hash * Maybe split up into open address hashing and chained hashing y or node based * Split up into 2 categories: open...

martinus

a interesting benchmark

1

random Insert and erase **begin** is a quite interesting benchmark I think you know why some hash maps maybe very slow and others are quite efficient. ``` #include "Map.h" #include...

ktprime

Add boost::unordered_flat_map to the benchmark

1

Boost 1.81 released its own `unordered_flat_map` implementation, it will be appreciated if you could add that to the benchmark as well.

atyuwen

I was comparing my implementation against @ktprime's hash_map8, which uses almost the same copy implementation as my implementation (malloc + memcpy), but for some reason mine was >2 times slower....

camel-cdr

CreateInsert & ClearInsert benchmarks

1

The benchmarks are kind of similar to `InsertHugeInt`, but stress test different sizes, some maps seem to really struggle after certain sizes:   (The above was just a quick...

camel-cdr

I know this is primarily a hash table benchmark suite of course, so by all means feel free to close as wontfix. But it would be really cool to add...

quicknir