std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_size (3) - Linux Manuals

std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_size: std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_size

NAME

std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_size - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_size

Synopsis


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_map>


  int main()
  {
      std::unordered_map<char,char> s;
      std::cout << "Maximum size of a 'unordered_map' is " << s.max_size() << "\n";
  }

Possible output:


  Maximum size of a 'unordered_map' is 768614336404564650

See also


     returns the number of elements
size (public member function)

Pages related to std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_size