Espaces de noms
Variantes
Affichages
Actions

std::unordered_multiset::insert

De cppreference.com

 
 
 
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
 
iterator insert( const value_type& value );
(1) (depuis C++11)
iterator insert( value_type&& value );
(2) (depuis C++11)
iterator insert( const_iterator hint, const value_type& value );
(3) (depuis C++11)
iterator insert( const_iterator hint, value_type&& value );
(4) (depuis C++11)
template< class InputIt >
void insert( InputIt first, InputIt last );
(5) (depuis C++11)
void insert( std::initializer_list<value_type> ilist );
(6) (depuis C++11)

Inserts element(s) to the container.

1-2)
inserts value.
Original:
inserts value.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

3-4) inserts value, using hint as a non-binding suggestion to where the search should start.

5)
éléments inserts de [first, last) plage .
Original:
inserts elements from range [first, last).
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
6)
éléments inserts de liste d'initialisation ilist .
Original:
inserts elements from initializer list ilist.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

If rehashing occurs due to the insertion, all iterators are invalidated. Otherwise iterators are not affected. References are not invalidated. Rehashing occurs only if the new number of elements is higher than max_load_factor()*bucket_count().

Sommaire

[modifier] Paramètres

hint -
itérateur, utilisé comme une suggestion quant à l'endroit où insérer le contenu
Original:
iterator, used as a suggestion as to where to insert the content
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
value -
élément de valeur à insérer
Original:
element value to insert
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
first, last -
éventail d'éléments à insérer
Original:
range of elements to insert
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
ilist -
initialiseur liste d'insérer les valeurs
Original:
initializer list to insert the values from
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Type requirements
-
InputIt must meet the requirements of InputIterator.

[modifier] Retourne la valeur

1-2) returns an iterator to the inserted element.

3-4) returns an iterator to the inserted element.

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

[modifier] Complexité

1-4) Average case: O(1), worst case O(size())

5-6) Average case: O(N), where N is the number of elements to insert. Worse case: O(N*size()+N)

[modifier] Voir aussi

constructs element in-place
(fonction membre publique) [edit]
construit éléments en place en utilisant un indice
Original:
constructs elements in-place using a hint
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) [edit]