< cpp‎ | container‎ | unordered multimap
Revision as of 19:37, 31 May 2013 by P12bot (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
void rehash( size_type count );
(since C++11)

Sets the number of buckets to count and rehashes the container, i.e. puts the elements into appropriate buckets considering that total number of buckets has changed. If the new number of buckets makes load factor more than maximum load factor (count < size() / max_load_factor()), then the new number of buckets is at least size() / max_load_factor().


[edit] Parameters

count - new number of buckets

[edit] Return value


[edit] Complexity

Average case linear in the size of the container, worst case quadratic.

[edit] Notes

rehash(0) may be used to force an unconditional rehash, such as after suspension of automatic rehashing by temporarily increasing max_load_factor().

[edit] See also

reserves space for at least the specified number of elements.
This regenerates the hash table.
(public member function) [edit]