A RetroSearch Logo

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

Search Query:

Showing content from https://cplusplus.com/reference/unordered_set/unordered_multiset/size/ below:

public member function

<unordered_set>

std::unordered_multiset::size 
size_type size() const noexcept;

Return container size

Returns the number of elements in the unordered_multiset container.

Parameters none

Return Value The number of elements in the container.

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
17
18
19
20
21
// unordered_multiset::size
#include <iostream>
#include <string>
#include <unordered_set>

int main ()
{
  std::unordered_multiset<std::string> myset;
  std::cout << "0. size: " << myset.size() << std::endl;

  myset = {"house","parking","office"};
  std::cout << "1. size: " << myset.size() << std::endl;

  myset.insert ("house");
  std::cout << "2. size: " << myset.size() << std::endl;

  myset.erase ("house");
  std::cout << "3. size: " << myset.size() << std::endl;

  return 0;
}

Output: 
0. size: 0
1. size: 3
2. size: 4
3. size: 2


Complexity Constant.

Iterator validity No changes.

See also
unordered_multiset::max_size
Return maximum size (public member function)
unordered_multiset::empty
Test whether container is empty (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