Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.tutorialspoint.com/cpp_standard_library/cpp_set_end.htm below:

C++ Set End Function

It returns an iterator referring to the past-the-end element in the set container.

Following are the ways in which std::set::end works in various C++ versions.

iterator end();
const_iterator end() const;

 iterator end() noexcept;
const_iterator end() const noexcept;

It returns an iterator referring to the past-the-end element in the set container.

It never throws exceptions.

Time complexity is contstant.

The following example shows the usage of std::set::end.

#include <iostream>
#include <set>

int main () {
   int myints[] = {50,40,30,20,10};
   std::set<int> myset (myints,myints+10);

   std::cout << "myset contains:";
   for (std::set<int>::iterator it = myset.begin(); it!=myset.end(); ++it)
      std::cout << ' ' << *it;

   std::cout << '\n';

   return 0;
}

The above program will compile and execute properly.

myset contains: -107717047 0 1 10 20 30 40 50 29015

set.htm

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4