Namensräume
Varianten

    operator=,!=(std::unordered_map)

    Aus cppreference.com
    See More

    [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++
     
    Container-Bibliothek
     
    std::unordered_map
    Member-Funktionen
    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
    Iteratoren
    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
    Kapazität
    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
    Modifiers
    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
    Eimer Schnittstelle
    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
    Hash Politik
    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
    Beobachter
    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)
    Vergleicht den Inhalt von zwei ungeordnete Behälter .
    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.
    Der Inhalt von zwei ungeordnete Behälter lhs und rhs sind gleichwertig, wenn folgende Bedingungen erfüllt sind:
    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()
    • jede Gruppe von entsprechenden Tasten [lhs_eq1, lhs_eq2) hat eine entsprechende Gruppe von äquivalenten Schlüssel in den anderen Behälter [rhs_eq1, rhs_eq2), die die folgenden Eigenschaften hat:
      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.

    Parameter

    lhs, rhs -
    ungeordnete Behälter zu vergleichen
    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.

    Rückgabewert

    1)

    true wenn die Inhalte der Behälter äquivalent sind, false anders angegeben
    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 wenn die Inhalte der Behälter nicht äquivalent sind, false anders angegeben
    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.

    Komplexität

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