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
vector
comparison operators
vector::vector
vector::~vector
member functions:
vector::assign
vector::at
vector::back
vector::begin
vector::capacity
vector::clear
vector::empty
vector::end
vector::erase
vector::front
vector::get_allocator
vector::insert
vector::max_size
vector::operator=
vector::operator[]
vector::pop_back
vector::push_back
vector::rbegin
vector::rend
vector::reserve
vector::resize
vector::size
vector::swap


vector::back

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

Access last element

Returns a reference to the last element in the vector container.

Unlike member vector::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 vector.

Member types reference and const_reference are the reference types to the elements of the vector 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
 
// vector::back
#include <iostream>
#include <vector>
using namespace std;
int main ()
{
  vector<int> myvector;
  myvector.push_back(10);
  while (myvector.back() != 0)
  {
    myvector.push_back ( myvector.back() -1 );
  }
  cout << "myvector contains:";
  for (unsigned i=0; i<myvector.size() ; i++)
    cout << " " << myvector[i];
  cout << endl;
  return 0;
}


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

Complexity

Constant.

See also

vector::front Access first element (public member function)
vector::at Access element (public member function)
vector::operator[] Access element (public member function)
vector::push_back Add element at the end (public member function)
vector::pop_back Delete last element (public member function)