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

public member function
      iterator end ();
const_iterator end () const;

Return iterator to end

vReturns an iterator referring to the past-the-end element in the list container.

Parameters

none

Return Value

An iterator to the element past the end of the sequence.

Both iterator and const_iterator are member types. In the list class template, these are bidirectional iterators.

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
 
// list::begin/end
#include <iostream>
#include <list>
using namespace std;
int main ()
{
  int myints[] = {75,23,65,42,13};
  list<int> mylist (myints,myints+5);
  list<int>::iterator it;
  cout << "mylist contains:";
  for ( it=mylist.begin() ; it != mylist.end(); it++ )
    cout << " " << *it;
  cout << endl;
  return 0;
}


Output:
mylist contains: 75 23 65 42 13

Complexity

Constant.

See also

list::begin Return iterator to beginning (public member function)
list::rbegin Return reverse iterator to reverse beginning (public member function)
list::rend Return reverse iterator to reverse end (public member function)