Skip site navigation (1)Skip section navigation (2)

FreeBSD Manual Pages

  
 
  

home | help 
std::unorde...et::reserve(3)  C++ Standard Libary std::unorde...et::reserve(3)

NAME
       std::unordered_multiset::reserve	- std::unordered_multiset::reserve

Synopsis
	  void reserve(	size_type count	);  (since C++11)

	  Sets	the  number  of	 buckets to the	number needed to accomodate at
       least count
	  elements without exceeding maximum load factor and rehashes the con-
       tainer, i.e. puts
	  the elements into appropriate	buckets	considering that total	number
       of buckets has
	  changed.  Effectively	 calls	rehash(std::ceil(count / max_load_fac-
       tor())).

Parameters
	  count	- new capacity of the container

Return value
	  (none)

Complexity
	  Average case linear in the size of the container,  worst  case  qua-
       dratic.

See also
	  rehash  reserves at least the	specified number of buckets and	regen-
       erates the hash
	  (C++11) table
		  (public member function)

http://cppreference.com		  2022.07.31	  std::unorde...et::reserve(3)

Want to link to this manual page? Use this URL:
<https://man.freebsd.org/cgi/man.cgi?query=std::unordered_multiset::reserve&sektion=3&manpath=FreeBSD+Ports+15.0>

home | help