std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::size
From cppreference.com
< cpp | container | unordered multiset
size_type size() const noexcept; |
(since C++11) | |
Returns the number of elements in the container, i.e. std::distance(begin(), end()).
Contents |
Parameters
(none)
Return value
The number of elements in the container.
Complexity
Constant.
Example
Run this code
#include <cassert> #include <unordered_set> int main() { std::unordered_multiset<int> nums{4, 2, 4, 2}; assert(nums.size() == 4); }
See also
checks whether the container is empty (public member function) | |
returns the maximum possible number of elements (public member function) | |
(C++17)(C++20) |
returns the size of a container or array (function template) |