Namespace
Varianti

std::unordered_multiset::reserve

Da cppreference.com.

 
 
 
std :: unordered_multiset
Membri funzioni
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_multiset::unordered_multiset
unordered_multiset::~unordered_multiset
unordered_multiset::operator=
unordered_multiset::get_allocator
Iteratori
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_multiset::begin
unordered_multiset::cbegin
unordered_multiset::end
unordered_multiset::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_multiset::erase
unordered_multiset::size
unordered_multiset::max_size
Modificatori
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_multiset::clear
unordered_multiset::insert
unordered_multiset::emplace
unordered_multiset::emplace_hint
unordered_multiset::erase
unordered_multiset::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_multiset::count
unordered_multiset::find
unordered_multiset::equal_range
Benna interfaccia
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_multiset::begin2
unordered_multiset::end2
unordered_multiset::bucket_count
unordered_multiset::max_bucket_count
unordered_multiset::bucket_size
unordered_multiset::bucket
Politica di 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_multiset::load_factor
unordered_multiset::max_load_factor
unordered_multiset::rehash
unordered_multiset::reserve
Osservatori
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_multiset::hash_function
unordered_multiset::key_eq
 
void reserve( size_type count );
(dal C++11)
Imposta il numero di secchi per il numero necessario per ospitare almeno elementi count senza superare il fattore di carico massimo e rimaneggiamenti del contenitore, cioè mette gli elementi in segmenti appropriati tenuto conto che il numero totale di bucket è cambiato. Chiama efficacemente 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.

Indice

[modifica] Parametri

count -
nuova capacità del contenitore
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.

[modifica] Valore di ritorno

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

[modifica] Complessità

caso medio lineare nella dimensione del, quadratica caso peggiore contenitore.
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.

[modifica] Vedi anche

reserves at least the specified number of buckets.
This regenerates the hash table.
(membro pubblico funzione) [edit]