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

FreeBSD Manual Pages

  
 
  

home | help 
std::unordered_set::rehash(3) C++ Standard Libarystd::unordered_set::rehash(3)

NAME
       std::unordered_set::rehash - std::unordered_set::rehash

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

	  Sets the number of buckets to	count and rehashes the container, i.e.
       puts the
	  elements  into  appropriate buckets considering that total number of
       buckets has
	  changed. If the new number of	buckets	makes load  factor  more  than
       maximum load
	  factor  (count < size() / max_load_factor()),	then the new number of
       buckets is at
	  least	size() / max_load_factor().

Parameters
	  count	- new number of	buckets

Return value
	  (none)

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

Notes
	  rehash(0)  may be used to force an unconditional rehash, such	as af-
       ter suspension of
	  automatic rehashing by temporarily increasing	max_load_factor().

See also
	  reserve reserves space for at	least the specified number of elements
       and regenerates
	  (C++11) the hash table
		  (public member function)

http://cppreference.com		  2022.07.31	 std::unordered_set::rehash(3)

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

home | help