Espaces de noms
Variantes

    operator=,!=(std::unordered_multimap)

    De 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++
     
    Bibliothèque de conteneurs
     
    std :: unordered_multimap
    Les fonctions membres
    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_multimap::unordered_multimap
    unordered_multimap::~unordered_multimap
    unordered_multimap::operator=
    unordered_multimap::get_allocator
    Les itérateurs
    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_multimap::begin
    unordered_multimap::cbegin
    unordered_multimap::end
    unordered_multimap::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_multimap::erase
    unordered_multimap::size
    unordered_multimap::max_size
    Modificateurs
    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_multimap::clear
    unordered_multimap::insert
    unordered_multimap::emplace
    unordered_multimap::emplace_hint
    unordered_multimap::erase
    unordered_multimap::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_multimap::count
    unordered_multimap::find
    unordered_multimap::equal_range
    Interface seau
    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_multimap::begin2
    unordered_multimap::end2
    unordered_multimap::bucket_count
    unordered_multimap::max_bucket_count
    unordered_multimap::bucket_size
    unordered_multimap::bucket
    Politique de hachage
    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_multimap::load_factor
    unordered_multimap::max_load_factor
    unordered_multimap::rehash
    unordered_multimap::reserve
    Des observateurs
    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_multimap::hash_function
    unordered_multimap::key_eq
     
    <tbody> </tbody>
    template< class Key, class T, class Hash, class KeyEqual, class Allocator > void operator=( unordered_multimap<Key,T,Hash,KeyEqual,Allocator> &lhs, unordered_multimap<Key,T,Hash,KeyEqual,Allocator> &rhs);
    		 (1)
    template< class Key, class T, class Hash, class KeyEqual, class Allocator > void operator!=( unordered_multimap<Key,T,Hash,KeyEqual,Allocator> &lhs, unordered_multimap<Key,T,Hash,KeyEqual,Allocator> &rhs);
    		 (2)
    Compare le contenu de deux conteneurs non ordonnée .
    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.
    Le contenu de deux conteneurs non ordonnée lhs et rhs sont équivalentes si les conditions suivantes sont vérifiées:
    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()
    • chaque groupe de touches équivalentes [lhs_eq1, lhs_eq2) a un groupe correspondant de touches équivalentes dans le [rhs_eq1, rhs_eq2) autre récipient, qui a les propriétés suivantes:
      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.

    Paramètres

    lhs, rhs -
    non ordonnée conteneurs à comparer
    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.

    Retourne la valeur

    1)

    true si le contenu des conteneurs sont équivalentes, sinon false
    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 si le contenu des récipients ne sont pas équivalentes, false contraire
    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.

    Complexité

    Σ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.