A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://en.cppreference.com/w/cpp/algorithm/../../cpp/../cpp/../cpp/container/list/pop_front.html below:

std::list<T,Allocator>::pop_front - cppreference.com

void pop_front();

(constexpr since C++26)

Removes the first element of the container.

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

(until C++26)

If empty() is true:

(since C++26)

References and iterators to the erased element are invalidated.

[edit] Complexity

Constant.

[edit] Example
#include <list>
#include <iostream>
 
int main()
{
    std::list<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'
[edit] See also removes the last element
(public member function) [edit] inserts an element to the beginning
(public member function) [edit] access the first element
(public member function) [edit]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4