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

From cppreference.com

Compiler support
Freestanding and hosted
Language
Standard library
Standard library headers
Named requirements
Feature test macros(C++20)
Language support library
Concepts library(C++20)
Diagnostics library
Memory management library
Metaprogramming library(C++11)
General utilities library
Containers library
Iterators library
Ranges library(C++20)
Algorithms library
Strings library
Text processing library
Numerics library
Date and time library
Input/output library
Filesystem library(C++17)
Concurrency support library(C++11)
Execution control library(C++26)
Technical specifications
Symbols index
External libraries

[edit]

Containers library

node-handle (C++17)
Sequence
array (C++11)
vector
vector<bool>
inplace_vector (C++26)
hive (C++26)
deque
forward_list (C++11)
list
Associative
set
multiset
map
multimap
Unordered associative
unordered_set (C++11)
unordered_multiset (C++11)
unordered_map (C++11)
unordered_multimap (C++11)
Adaptors
stack
queue
priority_queue
flat_set (C++23)
flat_multiset (C++23)
flat_map (C++23)
flat_multimap (C++23)
Views
span (C++20)
mdspan (C++23)
Tables
Iterator invalidation
Member function table
Non-member function table

deque::deque
deque::~deque
deque::operator=
deque::assign
deque::assign_range (C++23)
deque::get_allocator
Element access
deque::at
deque::operator[]
deque::front
deque::back
Iterators
deque::begindeque::cbegin (C++11)
deque::enddeque::cend (C++11)
deque::rbegindeque::crbegin (C++11)
deque::renddeque::crend (C++11)

Capacity
deque::empty
deque::size
deque::max_size
deque::shrink_to_fit (DR*)
Modifiers
deque::clear
deque::insert
deque::insert_range (C++23)
deque::emplace
deque::erase
deque::push_front
deque::emplace_front (C++11)
deque::prepend_range (C++23)
deque::pop_front
deque::push_back
deque::emplace_back (C++11)
deque::append_range (C++23)
deque::pop_back
deque::resize
deque::swap

Non-member functions

operator==operator<=> (C++20)
swap(std::deque)
erase(std::deque)erase_if(std::deque) (C++20)(C++20)

operator!=operator<operator>operator<=operator>=

(until C++20)(until C++20)(until C++20)(until C++20)(until C++20)

Deduction guides(C++17)

[edit]

void pop_back();		(constexpr since C++26)

Removes the last element of the container.

Ifempty() istrue, the behavior is undefined.

(until C++26)

Ifempty() istrue:

If the implementation ishardened, acontract violation occurs. Moreover, if the contract-violation handler returns under “observe” evaluation semantic, the behavior is undefined.
If the implementation is not hardened, the behavior is undefined.

(since C++26)

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

[edit]Complexity

Constant.

[edit]Example

Run this code

#include <deque>#include <iostream> namespace stq{template<typename T>void println(auto,const T& xz){std::cout<<'[';bool first{true};for(constauto& x: xz)std::cout<<(first? first=false,"":", ")<< x;std::cout<<"]\n";}} int main(){std::deque<int> numbers{1,2,3};    stq::println("{}", numbers);while(not numbers.empty()){        numbers.pop_back();        stq::println("{}", numbers);}}