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

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

C++ Set Library - count Function

It searches the container for elements equivalent to val and returns the number of matches.

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

size_type count (const value_type& val) const;

size_type count (const value_type& val) const;

It returns the number of matche

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::count.

#include <iostream>
#include <set>

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

   for (int i = 1; i < 15;++i) myset.insert(i*5);

   for (int i = 0; i < 5; ++i) {
      std::cout << i;
      if (myset.count(i)!=0)
         std::cout << " is an element of myset.\n";
      else
         std::cout << " is not an element of myset.\n";
   }

   return 0;
}

The above program will compile and execute properly.

0 is not an element of myset.
1 is not an element of myset.
2 is not an element of myset.
3 is not an element of myset.
4 is not an element of myset.

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