Espaces de noms
Variantes
Affichages
Actions

std::deque::insert

De cppreference.com
< cpp‎ | container‎ | deque

 
 
 
std :: deque
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.
deque::deque
deque::~deque
deque::operator=
deque::assign
deque::get_allocator
Elément d'accès
Original:
Element access
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
deque::front
deque::back
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.
deque::begin
deque::cbegin

(C++11)
deque::end
deque::cend

(C++11)
deque::rbegin
deque::crbegin

(C++11)
deque::rend
deque::crend

(C++11)
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.
deque::empty
deque::size
deque::max_size
deque::shrink_to_fit
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.
deque::clear
deque::insert
deque::emplace
deque::erase
deque::push_front
deque::emplace_front
deque::pop_front
deque::push_back
deque::emplace_back
deque::pop_back
deque::resize
deque::swap
 
iterator insert( iterator pos, const T& value );
iterator insert( const_iterator pos, const T& value );
(1) (avant C++11)
(depuis C++11)
iterator insert( const_iterator pos, T&& value );
(2) (depuis C++11)
void insert( iterator pos, size_type count, const T& value );
iterator insert( const_iterator pos, size_type count, const T& value );
(3) (avant C++11)
(depuis C++11)
template< class InputIt >

void insert( iterator pos, InputIt first, InputIt last);
template< class InputIt >

iterator insert( const_iterator pos, InputIt first, InputIt last );
(4) (avant C++11)

(depuis C++11)
iterator insert( const_iterator pos, std::initializer_list<T> ilist );
(5) (depuis C++11)
Éléments Inserts à la position spécifiée dans le conteneur .
Original:
Inserts elements to specified position in the container.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
1-2)
inserts value avant l'élément pointé par pos
Original:
inserts value before the element pointed to by pos
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
3)
inserts count copies du value avant l'élément pointé par pos
Original:
inserts count copies of the value before the element pointed to by pos
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
4)
éléments inserts de [first, last) plage avant l'élément pointé par pos
Original:
inserts elements from range [first, last) before the element pointed to by pos
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
5)
é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.

All iterators are invalidated. References are invalidated too, unless pos == begin() or pos == end(), in which case they are not invalidated.

Sommaire

[modifier] Paramètres

pos -
élément avant lequel le contenu sera inséré
Original:
element before which the content will be inserted
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 -
la plage d'éléments à insérer, ne peut pas être itérateurs dans le récipient pour lequel insert est appelée
Original:
the range of elements to insert, can't be iterators into container for which insert is called
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)
itérateur pointant sur le value inséré
Original:
iterator pointing to the inserted value
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
3)
itérateur pointant sur le premier élément inséré, ou si pos count==0 .
Original:
iterator pointing to the first element inserted, or pos if count==0.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
4)
itérateur pointant sur le premier élément inséré, ou si pos first==last .
Original:
iterator pointing to the first element inserted, or pos if first==last.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
5)
itérateur pointant sur le premier élément inséré, ou si pos ilist est vide .
Original:
iterator pointing to the first element inserted, or pos if ilist is empty.
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-2) Constant plus linear in the lesser of the distances between pos and either of the ends of the container.

3) Linear in count plus linear in the lesser of the distances between pos and either of the ends of the container.

4) Linear in std::distance(first, last) plus linear in the lesser of the distances between pos and either of the ends of the container.

5) Linear in ilist.size() plus linear in the lesser of the distances between pos and either of the ends of the container.

[modifier] Voir aussi

(C++11)
construit des éléments en mémoire
(fonction membre publique) [edit]
insère des éléments au début
(fonction membre publique) [edit]
ajoute des éléments à la fin
Original:
adds elements to the end
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]