Varianti

    operator=,!=(std::unordered_map)

    Da cppreference.com.

    [edit template]

    Questa pagina è stata tradotta in modo automatico dalla versione in ineglese della wiki usando Google Translate.

    La traduzione potrebbe contenere errori e termini strani. Muovi il puntatore sopra al testo per vedere la versione originale. Puoi aiutarci a correggere gli gli errori. Per ulteriori istruzioni clicca qui.

    Click here for the English version of this page

    <metanoindex/>

     
    C++
     
    Contenitori libreria
     
    std::unordered_map
    Membri funzioni
    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
    Iteratori
    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
    Capacità
    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
    Modificatori
    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
    Lookup
    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
    Benna interfaccia
    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
    Politica di 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
    Osservatori
    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)
    Confronta il contenuto di due contenitori non ordinata.
    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.
    Il contenuto di due contenitori non ordinata lhs e rhs sono equivalenti se le seguenti condizioni contenere:
    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()
    • ogni gruppo di tasti equivalenti [lhs_eq1, lhs_eq2) ha un corrispondente gruppo di tasti equivalenti della [rhs_eq1, rhs_eq2) altro contenitore, che ha le seguenti proprietà:
      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.

    Parametri

    lhs, rhs -
    non ordinato contenitori da confrontare
    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.

    Valore di ritorno

    1)

    true se il contenuto dei contenitori sono equivalenti, false altrimenti
    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 il contenuto dei contenitori non sono equivalenti, false altrimenti
    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.

    Complessità

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