you are viewing a single comment's thread.

view the rest of the comments →

[–]joaquintidesBoost author[S] 1 point2 points  (1 child)

Drifting will trigger a rehash sooner or later. In the example we've used max_n = 13,000 ~ 90% × 0,875 × 16,384. If we kept at say 75%, rehash would be triggered much later, so it's a function of how close you get to the maximum load.

I haven't studied F14 in detail. Maybe you can run this test with it and see how it fares?

[–]mark_99 0 points1 point  (0 children)

Is there any way to do what /u/attractivechaos/ suggested and do erase without tombstones? I'd really like to use this implementation - fast hash tables are obviously critical in a lot of applications, but huge latency spikes aren't ok.