std::unordered_multiset::size - cppreference.com

##### cppreference.com

##### Search

Create account

##### Namespaces

- Page
- Discussion

##### Variants

##### Views

- View
- Edit
- History

##### Actions

# std::unordered_multiset::size

From cppreference.com
< cpp‎ | container‎ | unordered multiset

[edit template]

size_type size() const; |  | (since C++11)

Returns the number of elements in the container, i.e. std::distance(begin(), end()).

### [edit] Parameters

(none)

### [edit] Return value

The number of elements in the container.

### [edit] Exceptions

`noexcept` specification:
noexcept

### [edit] Complexity

Constant.

### [edit] Example

[edit]

The following code uses `size` to display the number of elements in a std::unordered_multiset<int>:

Run this code

    #include <unordered_set>
    #include <iostream>

    int main()
    {
        std::unordered_multiset<int> nums {1, 3, 5, 7};

        std::cout << "nums contains " << nums.size() << " elements.\n";
    }

Output:

    nums contains 4 elements.

### [edit] See also

empty | checks whether the container is empty (public member function) [edit]
max_size | returns the maximum possible number of elements (public member function) [edit]

Retrieved from "http://en.cppreference.com/mwiki/index.php?title=cpp/container/unordered_multiset/size&oldid=50765"
Category:

- unconditionally noexcept

Hidden categories:

- Pages with unreviewed unconditional noexcept template
- Pages with unreviewed noexcept template