std::unordered_map::insert
 | Questa pagina è stata tradotta in modo automatico dalla versione in ineglese della wiki usando Google Translate. La traduzione potrebbe contenere errori e termini strani. Muovi il puntatore sopra al testo per vedere la versione originale. Puoi aiutarci a correggere gli gli errori. Per ulteriori istruzioni clicca qui. |
std::pair<iterator,bool> insert(const value_type& value ); | (1) | (dal C++11) |
template<class P> std::pair<iterator,bool> insert( P&& value ); | (2) | (dal C++11) |
iterator insert( const_iterator hint, const value_type& value ); | (3) | (dal C++11) |
template<class P> iterator insert( const_iterator hint, P&& value ); | (4) | (dal C++11) |
template<class InputIt > void insert( InputIt first, InputIt last ); | (5) | (dal C++11) |
void insert(std::initializer_list<value_type> ilist ); | (6) | (dal C++11) |
Inserts element(s) to the container, if the container doesn't already contain an element with equivalent key.
1-2)value. value. 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.
[first, last) gamma.[first, last).You can help to correct and verify the translation. Click here for instructions.
ilist.ilist.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().
Indice |
[modifica]Parametri
| hint | - | iteratore, usato come un suggerimento di dove inserire il contenuto 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 | - | elemento di valore da inserire 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 | - | intervallo di elementi da inserire 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 | - | inizializzatore lista per inserire i valori da 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. | ||
[modifica]Valore di ritorno
1-2) returns a pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place.
3-4) returns an iterator to the inserted element, or to the element that prevented the insertion.
5-6)You can help to correct and verify the translation. Click here for instructions.
[modifica]Complessità
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)
[modifica]Vedi anche
| constructs element in-place (metodo pubblico) | |
costruisce elementi in-place con un suggerimento 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. (metodo pubblico) | |
