std::deque::back

 

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 :: 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. maria 123456

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. maria 123456

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. maria 123456

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. maria 123456

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. maria 123456

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

 

reference back();
const_reference back() const;

Retourne référence au dernier élément dans le conteneur .

Original:

Returns reference to the last element 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.

maria 123456

Appel back sur un contenant vide est indéfini .

Original:

Calling back on an empty container is undefined.

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

maria 123456

Paramètres

(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.

maria 123456

Retourne la valeur

référence au dernier élément

Original:

reference to the last element

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

maria 123456

Complexité

Constante

Original:

Constant

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

maria 123456

Notes

Pour une c conteneur, le return c.back(); expression est équivalente à { auto tmp = c.end(); --tmp; return *tmp; }

Original:

For a container c, the expression return c.back(); is equivalent to { auto tmp = c.end(); --tmp; return *tmp; }

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

maria 123456

Exemple

Le code suivant utilise back pour afficher le dernier élément d'une std::deque<char>:

Original:

The following code uses back to display the last element of a std::deque<char>:

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

maria

123456

#include <deque>
#include <iostream>
 
int main()
{
    std::deque<char> letters {'o', 'm', 'g', 'w', 't', 'f'};
 
    if (!letters.empty()) {
        std::cout << "The last character is: " << letters.back() << '\n';
    }  
}

Résultat :

The last character is f

Voir aussi

front	accède au premier élément (fonction membre publique)