std::unordered_set::rehash
Da cppreference.com
< cpp | container | unordered set
 | 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 ); | (desde 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().
Índice |
[editar]Parâmetros
| count | - | new number of buckets |
[editar]Valor de retorno
(Nenhum)
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.
[editar]Complexidade
caso médio linear no tamanho do recipiente quadrática pior caso,.
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.
[editar]Veja também
reserva espaço para pelo menos o número especificado de elements. This regenera a tabela hash . 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. (função pública membro) | |
