A RetroSearch Logo

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

Search Query:

Showing content from https://www.tutorialspoint.com/cpp_standard_library/cpp_list_push_front.htm below:

C++ List push_front Function

C++ List Library - push_front() Function Description

The C++ function std::list::push_front() inserts new element at the beginning of list and increases size of list by one.

Declaration

Following is the declaration for std::list::push_front() function form std::list header.

C++98
void push_front (const value_type& val);
C++11
void push_front (const value_type& val);
Parameters

val − Value of element to be inserted into list.

Return value

None.

Exceptions

This member function never throws exception.

Time complexity

Constant i.e. O(1)

Example

The following example shows the usage of std::list::push_front() function.

#include <iostream>
#include <list>

using namespace std;

int main(void) {
   list<int> l;

   for (int i = 0; i < 5; ++i)
      l.push_front(i + 1);

   cout << "List contains following elements" << endl;

   for (auto it = l.begin(); it != l.end(); ++it)
      cout << *it << endl;

   return 0;
}

Let us compile and run the above program, this will produce the following result −

List contains following elements
5
4
3
2
1

list.htm


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