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

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

Return iterator to end

Returns an iterator referring to the past-the-end element in the vector container.

Notice that unlike member vector::back, which returns a reference to the element preceding this one, this function returns a random access iterator.

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 vector class template, these are random access iterators.

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 
// vector::end
#include <iostream>
#include <vector>
using namespace std;
int main ()
{
  vector<int> myvector;
  for (int i=1; i<=5; i++) myvector.insert(myvector.end(),i);
  cout << "myvector contains:";
  vector<int>::iterator it;
  for ( it=myvector.begin() ; it < myvector.end(); it++ )
    cout << " " << *it;
  cout << endl;
  return 0;
}


Output:
myvector contains: 1 2 3 4 5

Complexity

Constant.

See also

vector::back Access last element (public member function)
vector::begin Return iterator to beginning (public member type)
vector::rbegin Return reverse iterator to reverse beginning (public member function)
vector::rend Return reverse iterator to reverse end (public member function)