Espaços nominais
Variantes
Acções

std::unordered_multimap::reserve

Da cppreference.com

 
 
 
std :: unordered_multimap
Funções de membro
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_multimap::unordered_multimap
unordered_multimap::~unordered_multimap
unordered_multimap::operator=
unordered_multimap::get_allocator
Iteradores
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_multimap::begin
unordered_multimap::cbegin
unordered_multimap::end
unordered_multimap::cend
Capacidade
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_multimap::erase
unordered_multimap::size
unordered_multimap::max_size
Modificadores
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_multimap::clear
unordered_multimap::insert
unordered_multimap::emplace
unordered_multimap::emplace_hint
unordered_multimap::erase
unordered_multimap::swap
Pesquisa
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_multimap::count
unordered_multimap::find
unordered_multimap::equal_range
Interface de balde
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_multimap::begin2
unordered_multimap::end2
unordered_multimap::bucket_count
unordered_multimap::max_bucket_count
unordered_multimap::bucket_size
unordered_multimap::bucket
Política de hash
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_multimap::load_factor
unordered_multimap::max_load_factor
unordered_multimap::rehash
unordered_multimap::reserve
Observadores
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_multimap::hash_function
unordered_multimap::key_eq
 
void reserve( size_type count );
(a partir do C++ 11)
Define o número de baldes para o número necessário para acomodar, pelo menos, elementos count sem exceder fator de carga máxima e rehashes o recipiente, ou seja, coloca os elementos em baldes apropriados, considerando que o número total de baldes mudou. Efetivamente chama rehash(std::ceil(count / max_load_factor())).
Original:
Sets the number of buckets to the number needed to accomodate 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())).
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Índice

[editar] Parâmetros

count -
nova capacidade do recipiente
Original:
new capacity of the container
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

[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.

[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.

[editar] Veja também

reserves at least the specified number of buckets.
This regenerates the hash table.
(função pública membro) [edit]