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

public member function
void reverse ( );

Reverse the order of elements

Reverses the order of the elements in the list container.

All iterators and references to elements remain valid.

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
// reversing vector
#include <iostream>
#include <list>
using namespace std;
int main ()
{
  list<int> mylist;
  list<int>::iterator it;
  for (int i=1; i<10; i++) mylist.push_back(i);
  mylist.reverse();
  cout << "mylist contains:";
  for (it=mylist.begin(); it!=mylist.end(); ++it)
    cout << " " << *it;
  cout << endl;
  return 0;
}


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

Complexity

Linear in size.

See also