Namespaces
Variants
Views
Actions

std::unordered_map::reserve

From cppreference.com
< cpp‎ | container‎ | unordered map
Revision as of 20:36, 31 May 2013 by P12bot (Talk | contribs)

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

Sets the number of buckets to the number needed to accomodate at least count elements without exceeding maximum load factor and rehashes the container, i.e. puts the elements into appropriate buckets considering that total number of buckets has changed. Effectively calls rehash(std::ceil(count / max_load_factor())).

Contents

[edit] Parameters

count - new capacity of the container

[edit] Return value

(none)

[edit] Complexity

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

[edit] See also

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