std::list<T,Allocator>::front

From cppreference.com

Returns a reference to the first element in 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. 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)

Reference to the first element.

Constant.

For a container c, the expression c.front() is equivalent to *c.begin().

The following code uses front to display the first element of a std::list<char>:

Run this code

#include <cassert>
#include <list>
 
int main()
{
    std::list<char> letters{'a', 'b', 'c', 'd'};
    assert(letters.front() == 'a');
}

back	access the last element (public member function) [edit]
rendcrend (C++11)	returns a reverse iterator to the end (public member function) [edit]
begincbegin (C++11)	returns an iterator to the beginning (public member function) [edit]

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

Contents