##### cppreference.com

##### Search

Create account

##### Namespaces

- Page
- Discussion

##### Variants

##### Views

- View
- Edit
- History

##### Actions

# std::unordered_map::reserve

From cppreference.com
< cpp‎ | container‎ | unordered map

[edit template]

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

### [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

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

Retrieved from "http://en.cppreference.com/mwiki/index.php?title=cpp/container/unordered_map/reserve&oldid=50704"