A RetroSearch Logo

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

Search Query:

Showing content from https://cplusplus.com/unordered_multiset::count below:

public member function

<unordered_set>

std::unordered_multiset::count 
size_type count ( const key_type& k ) const;

Count elements with a specific key

Searches the container for elements with a value of k and returns the number of elements found.

Parameters
k
Value of the elements to be counted.
Member type key_type is the type of the elements in the container. In unordered_multiset containers it is the same as value_type, defined as an alias of the class's first template parameter (Key).

Return value The number of elements in the container with a key equivalent to k.

Member type size_type is an unsigned integral type.



Example 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
// unordered_multiset::count
#include <iostream>
#include <string>
#include <unordered_set>

int main ()
{
  std::unordered_multiset<std::string> myums =
    {"cow","pig","chicken","pig","pig","cow"};

  for (auto& x: {"cow","sheep","pig"}) {
    std::cout << x << ": " << myums.count(x) << std::endl;
  }

  return 0;
}

Output:


Complexity Average case: linear in the number of elements counted.
Worst case: linear in container size.

Iterator validity No changes.

See also
unordered_multiset::find
Get iterator to element (public member function)
unordered_multiset::size
Return container size (public member function)

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