std::deque<T,Allocator>::pop_back

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

void pop_back();

Removes the last element of the container.

Calling pop_back on an empty container is undefined.

Iterators and references to the erased element are invalidated. It is unspecified whether the past-the-end iterator is invalidated. Other references and iterators are not affected. (until C++11)
Iterators and references to the erased element are invalidated. The past-the-end iterator is also invalidated. Other references and iterators are not affected. (since C++11)

Parameters

(none)

Return value

(none)

Complexity

Constant.

Exceptions

(none)

Example

#include <deque>
#include <iostream>
 
template<typename T>
void print(T const & xs)
{
    std::cout << "[ ";
    for(auto const & x : xs) {
        std::cout << x << ' ';
    }
    std::cout << "]\n";
}
 
int main()
{
    std::deque<int> numbers;
 
    print(numbers); 
 
    numbers.push_back(5);
    numbers.push_back(3);
    numbers.push_back(4);
 
    print(numbers); 
 
    numbers.pop_back();
 
    print(numbers); 
}

Output:

[ ]
[ 5 3 4 ]
[ 5 3 ]


See also

removes the first element
(public member function)
adds an element to the end
(public member function)