std::unordered_multiset::rehash

 

C++

Langage

Concepts

Bibliothèque d'utilitaires

Bibliothèque pour les chaînes de caractères

Bibliothèque de conteneurs

Bibliothèque d'algorithmes

Bibliothèque d'itérateurs

Bibliothèque pour le calcul numérique

Bibliothèque pour les entrées/sorties

Bibliothèque pour la régionalisation

Bibliothèque pour les expressions régulières (C++11)

Bibliothèque pour les opérations atomiques (C++11)

Bibliothèque pour les processus légers (threads) (C++11)

 

Bibliothèque de conteneurs

array (C++11)

vector

deque

forward_list (C++11)

list

set

multiset

map

multimap

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

stack

queue

priority_queue

 

std :: unordered_multiset

Les fonctions membres 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

Les itérateurs 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

Modificateurs 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

Interface seau 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

Politique de hachage 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

Des observateurs 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 rehash( size_type count );		(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

reserve	réserve de l'espace pour au moins le nombre spécifié de elements. This régénère la table de hachage . 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. (fonction membre publique)