std::unordered_multiset::rehash

 

C++

Language

Concepts

Utilities library

Strings library

Containers library

Algorithms library

Iterators library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

 

Containers library

array (C++11)

vector

deque

forward_list (C++11)

list

set

multiset

map

multimap

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

stack

queue

priority_queue

 

std::unordered_multiset

Member functions

unordered_multiset::unordered_multiset

unordered_multiset::~unordered_multiset

unordered_multiset::operator=

unordered_multiset::get_allocator

Iterators

unordered_multiset::begin unordered_multiset::cbegin

unordered_multiset::end unordered_multiset::cend

Capacity

unordered_multiset::erase

unordered_multiset::size

unordered_multiset::max_size

Modifiers

unordered_multiset::clear

unordered_multiset::insert

unordered_multiset::emplace

unordered_multiset::emplace_hint

unordered_multiset::erase

unordered_multiset::swap

Lookup

unordered_multiset::count

unordered_multiset::find

unordered_multiset::equal_range

Bucket interface

unordered_multiset::begin(int)

unordered_multiset::end(int)

unordered_multiset::bucket_count

unordered_multiset::max_bucket_count

unordered_multiset::bucket_size

unordered_multiset::bucket

Hash policy

unordered_multiset::load_factor

unordered_multiset::max_load_factor

unordered_multiset::rehash

unordered_multiset::reserve

Observers

unordered_multiset::hash_function

unordered_multiset::key_eq

 

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().

Parameters

count

-

new number of buckets

Return value

(none)

Complexity

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

See also

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