VOOZH about

URL: https://www.geeksforgeeks.org/cpp/unordered_multiset-count-function-in-c-stl/

⇱ unordered_multiset count() function in C++ STL - GeeksforGeeks


  • Courses
  • Tutorials
  • Interview Prep

unordered_multiset count() function in C++ STL

Last Updated : 2 Aug, 2018
The unordered_multiset::count() is a built-in function in C++ STL which returns the count of elements in the unordered_multiset container which is equal to a given value. Syntax:
unordered_multiset_name.count(val)
Parameters: The function accepts a single mandatory parameter val which specifies the element whose count in the unordered_multiset container is to be returned. Return Value: It returns an unsigned integral type which denotes the number of times a value occurs in the container. Below programs illustrates the above function: Program 1:
Output:
11 occurs 3 times
12 occurs 2 times
13 occurs 2 times
14 occurs 1 times
Program 2:
Output:
a occurs 3 times
b occurs 2 times
c occurs 2 times
Comment