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

Fix a bug that was causing unnecessary rehahes.

Browse Source 
[SVN r56348]
This commit is contained in:
Daniel James
2009-09-21 21:18:01 +00:00
parent ff6e457651
commit 08d533cb88
1 changed files with 2 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
include/boost/unordered/detail/table.hpp
View File

@ -443,23 +443,19 @@ namespace boost { namespace unordered_detail {
this->create_buckets();
this->init_buckets();
}
// TODO: Another bug:
else if(min_buckets != this->bucket_count_) {
else {
// no throw:
// TODO: Needlessly calling next_prime twice.
std::size_t min_size = this->min_buckets_for_size(this->size_);
min_buckets = next_prime(min_buckets);
min_buckets = min_size > min_buckets ? min_size : min_buckets;
rehash_impl(min_buckets);
if(min_buckets != this->bucket_count_) rehash_impl(min_buckets);
}
}
// if hash function throws, basic exception safety
// strong otherwise
// TODO: Rewrite so that it doesn't need to keep updating size_.
template <class H, class P, class A, class G, class K>
void hash_table<H, P, A, G, K>
::rehash_impl(std::size_t num_buckets)