boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2025-07-31 20:04:29 +02:00
Code Issues Packages Projects Releases Wiki Activity

adjusted hysteresis factor

Browse Source
This commit is contained in:
joaquintides
2022-10-30 11:21:03 +01:00
parent 1ec659d57c
commit a81d78597d
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
include/boost/unordered/detail/foa.hpp
View File

@@ -1660,11 +1660,11 @@ private:
* when the number of erased elements is <= 10% of total elements at full * when the number of erased elements is <= 10% of total elements at full
* load, which is implemented by requesting additional F*size elements, * load, which is implemented by requesting additional F*size elements,
* with F = P * 10% / (1 - P * 10%), where P is the probability of an * with F = P * 10% / (1 - P * 10%), where P is the probability of an
* element having caused overflow; P has been determined to be ~0.187 via * element having caused overflow; P has been measured as ~0.162 under
* simulation, yielding F ~ 0.019 ~ 1/52. * ideal conditions, yielding F ~ 0.0165 ~ 1/61.
*/ */
auto new_arrays_=new_arrays(std::size_t( auto new_arrays_=new_arrays(std::size_t(
std::ceil(static_cast<float>(size_+size_/52+1)/mlf))); std::ceil(static_cast<float>(size_+size_/61+1)/mlf)));
iterator it; iterator it;
BOOST_TRY{ BOOST_TRY{
/* strong exception guarantee -> try insertion before rehash */ /* strong exception guarantee -> try insertion before rehash */