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


multiset::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 multiset 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 multiset 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
 
// multiset::begin/end
#include <iostream>
#include <set>
using namespace std;
int main ()
{
  int myints[] = {15,98,77,77,39};
  multiset<int> mymultiset (myints,myints+5);
  multiset<int>::iterator it;
  cout << "mymultiset contains:";
  for ( it=mymultiset.begin() ; it != mymultiset.end(); it++ )
    cout << " " << *it;
  cout << endl;
  return 0;
}


Output:
mymultiset contains: 15 39 77 77 98

Complexity

Constant.

See also

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