[ Web Proxy ]
URL:
Viewing: https://de.cppreference.com/cpp/container/unordered_multiset/operator_cmp [Back]  [Original]
operator=,!=(std::unordered_multiset) cppreference.com
cppreference.com
Namensrume
Varianten

    operator=,!=(std::unordered_multiset)

    Aus 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++
     
    Container-Bibliothek
     
    std :: unordered_multiset
    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_multiset::unordered_multiset
    unordered_multiset::~unordered_multiset
    unordered_multiset::operator=
    unordered_multiset::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_multiset::begin
    unordered_multiset::cbegin
    unordered_multiset::end
    unordered_multiset::cend
    Kapazitt
    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_multiset::erase
    unordered_multiset::size
    unordered_multiset::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_multiset::clear
    unordered_multiset::insert
    unordered_multiset::emplace
    unordered_multiset::emplace_hint
    unordered_multiset::erase
    unordered_multiset::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_multiset::count
    unordered_multiset::find
    unordered_multiset::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_multiset::begin2
    unordered_multiset::end2
    unordered_multiset::bucket_count
    unordered_multiset::max_bucket_count
    unordered_multiset::bucket_size
    unordered_multiset::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_multiset::load_factor
    unordered_multiset::max_load_factor
    unordered_multiset::rehash
    unordered_multiset::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_multiset::hash_function
    unordered_multiset::key_eq
     
    <tbody> </tbody>
    template< class Key, class Hash, class KeyEqual, class Allocator > void operator=( unordered_multiset<Key,Hash,KeyEqual,Allocator> &lhs, unordered_multiset<Key,Hash,KeyEqual,Allocator> &rhs);
    		 (1)
    template< class Key, class Hash, class KeyEqual, class Allocator > void operator!=( unordered_multiset<Key,Hash,KeyEqual,Allocator> &lhs, unordered_multiset<Key,Hash,KeyEqual,Allocator> &rhs);
    		 (2)
    Vergleicht den Inhalt von zwei ungeordnete Behlter .
    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 Behlter lhs und rhs sind gleichwertig, wenn folgende Bedingungen erfllt 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 Schlssel in den anderen Behlter [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 Behlter 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.

    Rckgabewert

    1)

    true wenn die Inhalte der Behlter 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 Behlter 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.

    Komplexitt

    Si2 comparisons of the keys in the average case, where S is the size of the ith equivalent key group. N2 comparisons of the keys in the worst case, where N is the size of the container.

    Web Proxy Viewer  |  New URL  |  Original Page