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

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

Access last element

Returns a reference to the last element in the container.

Unlike member list::end, which returns an iterator just past this element, this function returns a direct reference.

Parameters

none

Return value

A reference to the last 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
21
22
23
24
 
// list::back
#include <iostream>
#include <list>
using namespace std;
int main ()
{
  list<int> mylist;
  mylist.push_back(10);
  while (mylist.back() != 0)
  {
    mylist.push_back ( mylist.back() -1 );
  }
  cout << "mylist contains:";
  for (list<int>::iterator it=mylist.begin(); it!=mylist.end() ; ++it)
    cout << " " << *it;
  cout << endl;
  return 0;
}


Output:
mylist contains: 10 9 8 7 6 5 4 3 2 1 0

Complexity

Constant.

See also

list::front Access first element (public member function)
list::end Return iterator to end (public member function)
list::push_back Add element at the end (public member function)
list::pop_back Delete last element (public member function)