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::front

public member function
      reference front ( );
const_reference front ( ) const;

Access first element

Returns a reference to the first element in the list container.

Unlike member list::begin, which returns an iterator to this same element, this function returns a direct reference.

Parameters

none

Return value

A reference to the first element in the list container.

Member types reference and const_reference are the reference types to the elements of the container (for the default storage allocation model, allocator, these are T& and const T& respectively).

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
 
// list::front
#include <iostream>
#include <list>
using namespace std;
int main ()
{
  list<int> mylist;
  mylist.push_back(77);
  mylist.push_back(16);
  // now front equals 77, and back 16
  mylist.front() -= mylist.back();
  cout << "mylist.front() is now " << mylist.front() << endl;
  return 0;
}


Output:
mylist.front() is now 61

Complexity

Constant.

See also

list::back Access last element (public member function)
list::begin Return iterator to beginning (public member function)
list::push_front Insert element at beginning (public member function)
list::pop_front Delete first element (public member function)