std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::max_size

size_type max_size() const noexcept;		(since C++11)

Returns the maximum number of elements the container is able to hold due to system or library implementation limitations, i.e. std::distance(begin(), end()) for the largest container.

Parameters

(none)

Return value

Maximum number of elements.

Complexity

Constant.

Notes

This value typically reflects the theoretical limit on the size of the container, at most std::numeric_limits<difference_type>::max(). At runtime, the size of the container may be limited to a value smaller than max_size() by the amount of RAM available.

Example

Run this code

#include <iostream>
#include <unordered_set>
 
int main()
{
    std::unordered_multiset<char> s;
    std::cout << "Maximum size of a 'unordered_multiset' is " << s.max_size() << "\n";
}

Possible output:

Maximum size of a 'unordered_multiset' is 768614336404564650

Language
Standard Library Headers
Freestanding and hosted implementations
Named requirements
Language support library
Concepts library (C++20)
Diagnostics library
Utilities library
Strings library
Containers library
Iterators library
Ranges library (C++20)
Algorithms library
Numerics library
Input/output library
Localizations library
Regular expressions library (C++11)
Atomic operations library (C++11)
Thread support library (C++11)
Filesystem library (C++17)
Technical Specifications

array (C++11)
vector
deque
forward_list (C++11)
list
set
multiset
map
multimap
unordered_set (C++11)
unordered_multiset (C++11)
unordered_map (C++11)
unordered_multimap (C++11)
stack
queue
priority_queue
span (C++20)