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
map
comparison operators
map::map
map::~map
member functions:
map::begin
map::clear
map::count
map::empty
map::end
map::equal_range
map::erase
map::find
map::get_allocator
map::insert
map::key_comp
map::lower_bound
map::max_size
map::operator=
map::operator[]
map::rbegin
map::rend
map::size
map::swap
map::upper_bound
map::value_comp


map::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 map container.

Parameters

none

Return Value

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

Both iterator and const_iterator are member types. In the map class template, these are bidirectional iterators.
Dereferencing this iterator accesses the element's value, which is of type pair<const Key,T>.

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
 
// map::begin/end
#include <iostream>
#include <map>
using namespace std;
int main ()
{
  map<char,int> mymap;
  map<char,int>::iterator it;
  mymap['b'] = 100;
  mymap['a'] = 200;
  mymap['c'] = 300;
  // show content:
  for ( it=mymap.begin() ; it != mymap.end(); it++ )
    cout << (*it).first << " => " << (*it).second << endl;
  return 0;
}


Output:
a => 200
b => 100
c => 300

Complexity

Constant.

See also

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