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

 

C++

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)

Metaprogramming library (C++11)

Diagnostics library

General utilities library

Strings library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Numerics library

Localizations library

Input/output library

Filesystem library (C++17)

Regular expressions library (C++11)

Concurrency support library (C++11)

Technical specifications

Symbols index

External libraries

 

Containers library

Sequence

array (C++11)

vector

vector<bool>

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)

Iterator invalidation

Member function table

Non-member function table

 

std::deque

Member types

Member functions

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

std::swap

eraseerase_if (C++20)(C++20)

operator==operator!=operator<operator>operator<=operator>=operator<=> (until C++20)(until C++20)(until C++20)(until C++20)(until C++20)(C++20)

Deduction guides(C++17)

 

void pop_front();

Removes the first element of the container. If there are no elements in the container, the behavior is undefined.

Iterators and references to the erased element are invalidated. If the element is the last element in the container, the end() iterator is also invalidated. Other references and iterators are not affected.

Parameters

(none)

Return value

(none)

Complexity

Constant.

Exceptions

Does not throw.

Example

Run this code

#include <deque>
#include <iostream>
 
int main()
{
    std::deque<char> chars{'A', 'B', 'C', 'D'};
 
    for (; !chars.empty(); chars.pop_front())
        std::cout << "chars.front(): '" << chars.front() << "'\n";
}

Output:

chars.front(): 'A'
chars.front(): 'B'
chars.front(): 'C'
chars.front(): 'D'

See also

pop_back	removes the last element (public member function)
push_front	inserts an element to the beginning (public member function)
front	access the first element (public member function)