Espaços nominais
Variantes
    Ações

      operator=,!=(std::unordered_map)

      De cppreference.com

      [edit template]

      This page has been machine-translated from the English version of the wiki using Google Translate.

      The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here.

      Click here for the English version of this page

      <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>
      template< class Key, class T, class Hash, class KeyEqual, class Allocator > void operator=( unordered_map<Key,T,Hash,KeyEqual,Allocator> &lhs, unordered_map<Key,T,Hash,KeyEqual,Allocator> &rhs);
      		 (1)
      template< class Key, class T, class Hash, class KeyEqual, class Allocator > void operator!=( unordered_map<Key,T,Hash,KeyEqual,Allocator> &lhs, unordered_map<Key,T,Hash,KeyEqual,Allocator> &rhs);
      		 (2)
      Compara o conteúdo de dois recipientes desordenada.
      Original:
      Compares the contents of two unordered containers.
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      O conteúdo de dois recipientes lhs desordenada e rhs são equivalentes se as seguintes condições espera:
      Original:
      The contents of two unordered containers lhs and rhs are equivalent if the following conditions hold:
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      • lhs.size() == rhs.size()
      • cada grupo de chaves equivalentes [lhs_eq1, lhs_eq2) tem um grupo correspondente de chaves equivalentes no [rhs_eq1, rhs_eq2) outro recipiente, que tem as seguintes propriedades:
        Original:
        each group of equivalent keys [lhs_eq1, lhs_eq2) has a corresponding group of equivalent keys in the other container [rhs_eq1, rhs_eq2), that has the following properties:
        The text has been machine-translated via Google Translate.
        You can help to correct and verify the translation. Click here for instructions.
      • std::distance(lhs_eq1, lhs_eq2) == std::distance(rhs_eq1, rhs_eq2).
      • std::is_permutation(lhs_eq1, lhs_eq2, rhs_eq1) == true.

      Parâmetros

      lhs, rhs -
      desordenada recipientes para comparar
      Original:
      unordered containers to compare
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      Valor de retorno

      1)

      true se os conteúdos dos recipientes são equivalentes, false contrário
      Original:
      true if the contents of the containers are equivalent, false otherwise
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      2)

      true se o conteúdo dos recipientes não são equivalentes, false contrário
      Original:
      true if the contents of the containers are not equivalent, false otherwise
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      Complexidade

      N comparisons of the keys in the average case, N2 in the worst case, where N is the size of the container.