std::unordered_multiset::rehash
Aus cppreference.com
< cpp | container | unordered multiset
 |
This page has been machine-translated from the English version of the wiki using Google Translate.
The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here. |
| void rehash( size_type count ); |
(seit 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().
Inhaltsverzeichnis |
[Bearbeiten] Parameter
| count | - | new number of buckets |
[Bearbeiten] Rückgabewert
(None)
Original:
(none)
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
[Bearbeiten] Komplexität
durchschnittlichen Fall linear in der Größe des Behälters, schlimmsten Fall quadratische .
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.
You can help to correct and verify the translation. Click here for instructions.
[Bearbeiten] Siehe auch
| reserviert Platz für mindestens die angegebene Anzahl von Elementen. Dies erzeugt die Hash-Tabelle neu. (öffentliche Elementfunktion) | |
