std::unordered_map::rehash - cppreference.com
Espaços nominais
Variantes
    Ações

      std::unordered_map::rehash

      De cppreference.com

      [edit template]

      <metanoindex/>

       
      C++
       
      Recipientes biblioteca
       
      std::unordered_map
      Funções de membro
      Original:
      Member functions
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      unordered_map::unordered_map
      unordered_map::~unordered_map
      unordered_map::operator=
      unordered_map::get_allocator
      Iteradores
      Original:
      Iterators
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      unordered_map::begin
      unordered_map::cbegin
      unordered_map::end
      unordered_map::cend
      Capacidade
      Original:
      Capacity
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      unordered_map::erase
      unordered_map::size
      unordered_map::max_size
      Modificadores
      Original:
      Modifiers
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      unordered_map::clear
      unordered_map::insert
      unordered_map::emplace
      unordered_map::emplace_hint
      unordered_map::erase
      unordered_map::swap
      Pesquisa
      Original:
      Lookup
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      unordered_map::count
      unordered_map::find
      unordered_map::equal_range
      Interface de balde
      Original:
      Bucket interface
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      unordered_map::begin2
      unordered_map::end2
      unordered_map::bucket_count
      unordered_map::max_bucket_count
      unordered_map::bucket_size
      unordered_map::bucket
      Política de hash
      Original:
      Hash policy
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      unordered_map::load_factor
      unordered_map::max_load_factor
      unordered_map::rehash
      unordered_map::reserve
      Observadores
      Original:
      Observers
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      unordered_map::hash_function
      unordered_map::key_eq
       
      <tbody> </tbody>
      void rehash( size_type count );
      		 (desde 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().

      Parâmetros

      count - new number of buckets

      Valor de retorno

      (Nenhum)
      Original:
      (none)
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      Complexidade

      caso médio linear no tamanho do recipiente quadrática pior caso,.
      Original:
      average case linear in the size of the container, worst case quadratic.
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      Veja também