set::begin
public member function
iterator begin ();
const_iterator begin () const;
Return iterator to beginning
Returns an iterator referring to the first element in the set container.
Internally, set containers keep their elements ordered from lower to higher, therefore begin returns the element with the lowest key value in the set.
Parameters
none
Return Value
An iterator to the first element in the container.
Both iterator and const_iterator are member types. In the set 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
|
// set::begin/end
#include <iostream>
#include <set>
using namespace std;
int main ()
{
int myints[] = {75,23,65,42,13};
set<int> myset (myints,myints+5);
set<int>::iterator it;
cout << "myset contains:";
for ( it=myset.begin() ; it != myset.end(); it++ )
cout << " " << *it;
cout << endl;
return 0;
}
|
Output:
myset contains: 13 23 42 65 75
|
Complexity
Constant.
See also
| set::end | Return iterator to end (public member function) |
| set::rbegin | Return reverse iterator to reverse beginning (public member function) |
| set::rend | Return reverse iterator to reverse end (public member function) |
|