list front() function in C++ STL
The list::front() is a built-in function in C++ STL which is used to return a reference to the first element in a list container. Unlike the list::begin() function, this function returns a direct reference to the first element in the list container.
Syntax:
list_name.front()
Parameters: This function does not accept any parameter, it simply returns a reference to the first element in the list container.
Return Value: This function returns a direct reference to the first element in the list container.
Exception: This function creates an undefined behavior when used with an empty list container.
Below program illustrates the list::front() function.
// CPP program to illustrate the // list::front() function #include <bits/stdc++.h> using namespace std; int main() { // Creating a list list<int> demoList; // Add elements to the List demoList.push_back(10); demoList.push_back(20); demoList.push_back(30); demoList.push_back(40); // get the first element using front() int ele = demoList.front(); // Print the first element cout << ele; return 0; } |
chevron_right
filter_none
Output:
10
Note: This function works in constant time complexity.
Recommended Posts:
- list::front() and list::back() in C++ STL
- std::string::front() in C++with Examples
- list end() function in C++ STL
- list merge() function in C++ STL
- list splice() function in C++ STL
- list emplace() function in C++ STL
- list pop_front() function in C++ STL
- list push_front() function in C++ STL
- list erase() function in C++ STL
- list empty() function in C++ STL
- list size() function in C++ STL
- list resize() function in C++ STL
- list reverse function in C++ STL
- list pop_back() function in C++ STL
- list remove() function in C++ STL
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
