Espaces de noms
Variantes
Affichages
Actions

std::unordered_set::rehash

De cppreference.com

 
 
 
std :: unordered_set
Les fonctions membres
Original:
Member functions
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_set::unordered_set
unordered_set::~unordered_set
unordered_set::operator=
unordered_set::get_allocator
Les itérateurs
Original:
Iterators
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_set::begin
unordered_set::cbegin
unordered_set::end
unordered_set::cend
Capacité
Original:
Capacity
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_set::erase
unordered_set::size
unordered_set::max_size
Modificateurs
Original:
Modifiers
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_set::clear
unordered_set::insert
unordered_set::emplace
unordered_set::emplace_hint
unordered_set::erase
unordered_set::swap
Lookup
Original:
Lookup
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_set::count
unordered_set::find
unordered_set::equal_range
Interface seau
Original:
Bucket interface
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_set::begin2
unordered_set::end2
unordered_set::bucket_count
unordered_set::max_bucket_count
unordered_set::bucket_size
unordered_set::bucket
Politique de hachage
Original:
Hash policy
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_set::load_factor
unordered_set::max_load_factor
unordered_set::rehash
unordered_set::reserve
Des observateurs
Original:
Observers
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_set::hash_function
unordered_set::key_eq
 
void rehash( size_type count );
(depuis C++11)

Sets the number of buckets to count and rehashes the container, i.e. puts the elements into appropriate buckets considering that total number of buckets has changed. If the new number of buckets makes load factor more than maximum load factor (count < size() / max_load_factor()), then the new number of buckets is at least size() / max_load_factor().

Sommaire

[modifier] Paramètres

count - new number of buckets

[modifier] Retourne la valeur

(Aucun)
Original:
(none)
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

[modifier] Complexité

cas linéaire moyenne de la taille du récipient, quadratique pire des cas .
Original:
average case linear in the size of the container, worst case quadratic.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

[modifier] Voir aussi

réserve de l'espace pour au moins le nombre spécifié de elements.
This régénère la table de hachage .
Original:
reserves space for at least the specified number of elements.
This regenerates the hash table.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

(fonction membre publique) [edit]