# std::unordered_multimap<Key,T,Hash,KeyEqual,Allocator>::reserve

> C++ Atlas: `cppatlas.com/w/cpp/container/unordered_multimap/reserve` | Source: https://en.cppreference.com/w/cpp/container/unordered_multimap/reserve | Domain: Containers | Standards: C++11

Sets the number of buckets to the number needed to accommodate 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…

## Official Specification Summary (cppreference)

```cpp
void reserve( size_type count ); // (since C++11)
```

Sets the number of buckets to the number needed to accommodate 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()))`.

### Parameters

- `count` - new capacity of the container

### Return value

(none)

### Complexity

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

### See also

- [`rehash`](https://en.cppreference.com/w/cpp/container/unordered_multimap/rehash): reserves at least the specified number of buckets and regenerates the hash table (public member function)

---
Attribution: content from https://en.cppreference.com/w/cpp/container/unordered_multimap/reserve (cppreference.com), licensed under CC-BY-SA 3.0 and GFDL. Modified: converted to markdown, study notes added. Offline snapshot of 9 February 2025.