std::unordered_multimap::rehash — cppreference.com
De cppreference.com
<metanoindex/>
<tbody> </tbody>
|
|
(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().
Paramètres
| count | - | new number of buckets |
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.
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.
Voir aussi
| réserve de l'espace mémoire pour au moins le nombre spécifié d'elements. Cela régénère la table de hachage. (fonction membre publique) [edit] | |