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


set::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 set 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 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::begin Return iterator to beginning (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)