std::unordered_set<Key,Hash,KeyEqual,Allocator>::reserve
From cppreference.com
< cpp | container | unordered set
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Containers library
(C++17)
(C++11)
(C++26)
(C++26)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++23)
(C++23)
(C++23)
(C++20)
(C++23)
Tables
std::unordered_set 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
[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.