Difference between revisions of "cpp/container/unordered multiset/reserve"
From cppreference.com
< cpp | container | unordered multiset
m (Add link to edit the included template) |
m (r2.7.3) (Robot: Adding de, es, fr, it, ja, pt, ru, zh) |
||
| Line 1: | Line 1: | ||
{{page template|cpp/container/reserve unord|unordered_multiset}} | {{page template|cpp/container/reserve unord|unordered_multiset}} | ||
| + | |||
| + | [[de:cpp/container/unordered multiset/reserve]] | ||
| + | [[es:cpp/container/unordered multiset/reserve]] | ||
| + | [[fr:cpp/container/unordered multiset/reserve]] | ||
| + | [[it:cpp/container/unordered multiset/reserve]] | ||
| + | [[ja:cpp/container/unordered multiset/reserve]] | ||
| + | [[pt:cpp/container/unordered multiset/reserve]] | ||
| + | [[ru:cpp/container/unordered multiset/reserve]] | ||
| + | [[zh:cpp/container/unordered multiset/reserve]] | ||
Revision as of 18:00, 2 November 2012
| 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())).
Contents |
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
| reserves at least the specified number of buckets and regenerates the hash table (public member function) |
