operator=,!=(std::unordered_set) - cppreference.com
Espaços nominais
Variantes
    Ações

      operator=,!=(std::unordered_set)

      De cppreference.com

      [edit template]

      <metanoindex/>

       
      C++
       
      Recipientes biblioteca
       
      std :: unordered_set
      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_set::unordered_set
      unordered_set::~unordered_set
      unordered_set::operator=
      unordered_set::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_set::begin
      unordered_set::cbegin
      unordered_set::end
      unordered_set::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_set::erase
      unordered_set::size
      unordered_set::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_set::clear
      unordered_set::insert
      unordered_set::emplace
      unordered_set::emplace_hint
      unordered_set::erase
      unordered_set::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_set::count
      unordered_set::find
      unordered_set::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_set::begin2
      unordered_set::end2
      unordered_set::bucket_count
      unordered_set::max_bucket_count
      unordered_set::bucket_size
      unordered_set::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_set::load_factor
      unordered_set::max_load_factor
      unordered_set::rehash
      unordered_set::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_set::hash_function
      unordered_set::key_eq
       
      <tbody> </tbody>
      template< class Key, class Hash, class KeyEqual, class Allocator > void operator=( unordered_set<Key,Hash,KeyEqual,Allocator> &lhs, unordered_set<Key,Hash,KeyEqual,Allocator> &rhs);
      		 (1)
      template< class Key, class Hash, class KeyEqual, class Allocator > void operator!=( unordered_set<Key,Hash,KeyEqual,Allocator> &lhs, unordered_set<Key,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

      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.