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

void pop_front();

(since C++11)

Removes the first 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)

References and iterators to the erased element are invalidated.

Complexity

Constant.

Example

#include <forward_list>
#include <iostream>

int main()
{
    std::forward_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'

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

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

Complexity

Example

See also