Difference between revisions of "cpp/container/unordered set/size"
From cppreference.com
< cpp | container | unordered set
m (langlinks) |
|||
| (4 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | {{cpp/container/size|unordered_set}} | + | {{include page|cpp/container/size|unordered_set}} |
| + | |||
| + | {{langlinks|de|es|fr|it|ja|pt|ru|zh}} | ||
Latest revision as of 05:12, 12 January 2021
| size_type size() const noexcept; |
(since C++11) | |
Returns the number of elements in the container, i.e. std::distance(begin(), end()).
Contents |
[edit] Parameters
(none)
[edit] Return value
The number of elements in the container.
[edit] Complexity
Constant.
[edit] Example
Run this code
#include <cassert> #include <unordered_set> int main() { std::unordered_set<int> nums{4, 2, 4, 2}; assert(nums.size() == 2); }
[edit] 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) |
