| CARVIEW |
Select Language
HTTP/1.1 301 Moved Permanently
Server: nginx
Date: Sat, 19 Jul 2025 10:36:09 GMT
Content-Type: text/html; charset=UTF-8
Transfer-Encoding: chunked
Connection: keep-alive
Location: /reference/unordered_map/unordered_map/rehash/
HTTP/1.1 200 OK
Server: nginx
Date: Sat, 19 Jul 2025 10:36:10 GMT
Content-Type: text/html; charset=utf-8
Transfer-Encoding: chunked
Connection: keep-alive
ETag: W/"8c24-TLrXCxnd7GwWMXejMMa0hTI7cek"
Content-Encoding: gzip
Sets the number of buckets in the container to n or more.
If n is greater than the current number of buckets in the container (bucket_count), a rehash is forced. The new bucket count can either be equal or greater than n.
If n is lower than the current number of buckets in the container (bucket_count), the function may have no effect on the bucket count and may not force a rehash.
A rehash is the reconstruction of the hash table: All the elements in the container are rearranged according to their hash value into the new set of buckets. This may alter the order of iteration of elements within the container.
Rehashes are automatically performed by the container whenever its load factor is going to surpass its max_load_factor in an operation.
Notice that this function expects the number of buckets as argument. A similar function exists, unordered_map::reserve, that expects the number of elements in the container as argument.
Possible output:
By calling rehash to reserve a certain minimum amount of buckets in the hash table, we avoid the multiple rehashes that the expansion of the container may cause.
Average case: linear in container size.
Worst case: quadratic in container size.
If no actual rehash happens, no changes.
Reference
C library:
- <cassert> (assert.h)
- <cctype> (ctype.h)
- <cerrno> (errno.h)
-
<cfenv> (fenv.h)C++11
- <cfloat> (float.h)
-
<cinttypes> (inttypes.h)C++11
- <ciso646> (iso646.h)
- <climits> (limits.h)
- <clocale> (locale.h)
- <cmath> (math.h)
- <csetjmp> (setjmp.h)
- <csignal> (signal.h)
- <cstdarg> (stdarg.h)
-
<cstdbool> (stdbool.h)C++11
- <cstddef> (stddef.h)
-
<cstdint> (stdint.h)C++11
- <cstdio> (stdio.h)
- <cstdlib> (stdlib.h)
- <cstring> (string.h)
-
<ctgmath> (tgmath.h)C++11
- <ctime> (time.h)
-
<cuchar> (uchar.h)C++11
- <cwchar> (wchar.h)
- <cwctype> (wctype.h)
Containers:
-
<array>C++11
- <deque>
-
<forward_list>C++11
- <list>
- <map>
- <queue>
- <set>
- <stack>
-
<unordered_map>C++11
-
<unordered_set>C++11
- <vector>
-
Input/Output:
Multi-threading:
-
<atomic>C++11
-
<condition_variable>C++11
-
<future>C++11
-
<mutex>C++11
-
<thread>C++11
-
Other:
- <algorithm>
- <bitset>
-
<chrono>C++11
-
<codecvt>C++11
- <complex>
- <exception>
- <functional>
-
<initializer_list>C++11
- <iterator>
- <limits>
- <locale>
- <memory>
- <new>
- <numeric>
-
<random>C++11
-
<ratio>C++11
-
<regex>C++11
- <stdexcept>
- <string>
-
<system_error>C++11
-
<tuple>C++11
-
<type_traits>C++11
-
<typeindex>C++11
- <typeinfo>
- <utility>
- <valarray>
<unordered_map>
-
unordered_mapC++11
-
unordered_multimapC++11
unordered_map
-
unordered_map::~unordered_mapC++11
-
unordered_map::unordered_mapC++11
member functions
-
unordered_map::atC++11
-
unordered_map::beginC++11
-
unordered_map::bucketC++11
-
unordered_map::bucket_countC++11
-
unordered_map::bucket_sizeC++11
-
unordered_map::cbeginC++11
-
unordered_map::cendC++11
-
unordered_map::clearC++11
-
unordered_map::countC++11
-
unordered_map::emplaceC++11
-
unordered_map::emplace_hintC++11
-
unordered_map::emptyC++11
-
unordered_map::endC++11
-
unordered_map::equal_rangeC++11
-
unordered_map::eraseC++11
-
unordered_map::findC++11
-
unordered_map::get_allocatorC++11
-
unordered_map::hash_functionC++11
-
unordered_map::insertC++11
-
unordered_map::key_eqC++11
-
unordered_map::load_factorC++11
-
unordered_map::max_bucket_countC++11
-
unordered_map::max_load_factorC++11
-
unordered_map::max_sizeC++11
-
unordered_map::operator[]C++11
-
unordered_map::operator=C++11
-
unordered_map::rehashC++11
-
unordered_map::reserveC++11
-
unordered_map::sizeC++11
-
unordered_map::swapC++11
-
non-member overloads
-
operators (unordered_map)C++11
-
swap (unordered_map)C++11
-
public member function
<unordered_map>
std::unordered_map::rehash
void rehash( size_type n );
Set number of buckets
If n is greater than the current number of buckets in the container (bucket_count), a rehash is forced. The new bucket count can either be equal or greater than n.
If n is lower than the current number of buckets in the container (bucket_count), the function may have no effect on the bucket count and may not force a rehash.
A rehash is the reconstruction of the hash table: All the elements in the container are rearranged according to their hash value into the new set of buckets. This may alter the order of iteration of elements within the container.
Rehashes are automatically performed by the container whenever its load factor is going to surpass its max_load_factor in an operation.
Notice that this function expects the number of buckets as argument. A similar function exists, unordered_map::reserve, that expects the number of elements in the container as argument.
Parameters
- n
- The minimum number of buckets for the container hash table.
Member type size_type is an unsigned integral type.
Return value
noneExample
|
|
Possible output:
current bucket_count: 23 |
By calling rehash to reserve a certain minimum amount of buckets in the hash table, we avoid the multiple rehashes that the expansion of the container may cause.
Complexity
In case of rehash,Average case: linear in container size.
Worst case: quadratic in container size.
Iterator validity
If a rehash happens, all iterators are invalidated, but references and pointers to individual elements remain valid.If no actual rehash happens, no changes.
See also
- unordered_map::reserve
- Request a capacity change (public member function)
- unordered_map::bucket_count
- Return number of buckets (public member function)
- unordered_map::max_load_factor
- Get or set maximum load factor (public member function)
- unordered_map::size
- Return container size (public member function)
Home page | Privacy policy
© cplusplus.com, 2000-2025 - All rights reserved - v3.3.4s
Spotted an error? contact us
© cplusplus.com, 2000-2025 - All rights reserved - v3.3.4s
Spotted an error? contact us