feedc0de/boost_unordered
1
0
Fork 0
forked from boostorg/unordered
Code Pull Requests Activity

Update how the required number of buckets is calculated to nest the max call

Browse Source
This commit is contained in:
Christian Mazakas
2022-10-26 13:46:19 -07:00
parent 0937f6443c
commit 5e5addd82d
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
include/boost/unordered/detail/implementation.hpp
View File

@ -3411,8 +3411,8 @@ namespace boost {
template <typename Types> template <typename Types>
inline void table<Types>::rehash(std::size_t num_buckets) inline void table<Types>::rehash(std::size_t num_buckets)
{ {
num_buckets = (std::max)( num_buckets = buckets_.bucket_count_for(
min_buckets(size_, mlf_), buckets_.bucket_count_for(num_buckets)); (std::max)(min_buckets(size_, mlf_), num_buckets));
if (num_buckets != this->bucket_count()) { if (num_buckets != this->bucket_count()) {
this->rehash_impl(num_buckets); this->rehash_impl(num_buckets);