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

void pop_back();

Removes the last element of the container.

If empty() is true, the behavior is undefined.

(until C++26)

If empty() is true:

If the implementation is hardened, a contract violation occurs.
If the implementation is not hardened, the behavior is undefined.

(since C++26)

Iterators and references to the last element are invalidated. The end() iterator is also invalidated.

Complexity

Constant.

Example

#include <deque>
#include <print>

int main()
{
    std::deque<int> numbers{1, 2, 3};
    for (; not numbers.empty(); numbers.pop_back())
        std::println("{}", numbers);
}

Output:

[1, 2, 3]
[1, 2]
[1]

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

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

Complexity

Example

See also