Reference
C Library
IOstream Library
Strings library
STL Containers
STL Algorithms
Miscellaneous
STL Containers
bitset
deque
list
map
multimap
multiset
priority_queue
queue
set
stack
vector
list
comparison operators
list::list
list::~list
member functions:
list::assign
list::back
list::begin
list::clear
list::empty
list::end
list::erase
list::front
list::get_allocator
list::insert
list::max_size
list::merge
list::operator=
list::pop_back
list::pop_front
list::push_back
list::push_front
list::rbegin
list::remove
list::remove_if
list::rend
list::resize
list::reverse
list::size
list::sort
list::splice
list::swap
list::unique


list::pop_front

public member function
void pop_front ( );

Delete first element

Removes the first element in the list container, effectively reducing the list size by one.

This calls the removed element's destructor.

Parameters

none

Return value

none

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
 
// list::pop_front
#include <iostream>
#include <list>
using namespace std;
int main ()
{
  list<int> mylist;
  mylist.push_back (100);
  mylist.push_back (200);
  mylist.push_back (300);
  cout << "Popping out the elements in mylist:";
  while (!mylist.empty())
  {
    cout << " " << mylist.front();
    mylist.pop_front();
  }
  cout << "\nFinal size of mylist is " << int(mylist.size()) << endl;
  return 0;
}

Output:
Popping out the elements in mylist: 100 200 300
Final size of mylist is 0

Complexity

Constant.

See also

list::pop_back Delete last element (public member function)
list::push_front Insert element at beginning (public member function)
list::erase Erase elements (public member function)