public member function
<set>
iterator begin ();
const_iterator begin () const;
Return iterator to beginning
Returns an iterator referring to the first element in the
multiset container.
Internally,
multiset containers keep their elements ordered from lower to higher, therefore
begin returns the element with the lowest key value in the
multiset.
Parameters
none
Return Value
An iterator to the first element in 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[] = {42,71,71,71,12};
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: 12 42 71 71 71
|
Complexity
Constant.
See also
- multiset::end
- Return iterator to end (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)