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

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

C++ Set Find Function

It searches the container for an element equivalent to val and returns an iterator to it if found, otherwise it returns an iterator to set::end.

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

iterator find (const value_type& val) const;

const_iterator find (const value_type& val) const;
iterator       find (const value_type& val);

It returns an iterator to set::end.

If an exception is thrown, there are no changes in the container.

Time complexity depens on logarithmic.

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

#include <iostream>
#include <set>

int main () {
   std::set<int> myset;
   std::set<int>::iterator it;

   for (int i = 1; i <= 10; i++) myset.insert(i*10);    
   it = myset.find(40);
   myset.erase (it);
   myset.erase (myset.find(60));

   std::cout << "myset contains:";
   for (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: 10 20 30 50 70 80 90 100

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