operator=,!=(std::unordered_multimap)
De cppreference.com
< cpp | container | unordered multimap
 |
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. |
| template< class Key, class T, class Hash, class KeyEqual, class Allocator > void operator=( unordered_multimap<Key,T,Hash,KeyEqual,Allocator> &lhs, |
(1) | |
| template< class Key, class T, class Hash, class KeyEqual, class Allocator > void operator!=( unordered_multimap<Key,T,Hash,KeyEqual,Allocator> &lhs, |
(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.
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.
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.
[modifier] 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. |
[modifier] Retourne la valeur
1)true si le contenu des conteneurs sont équivalentes, sinon false
2) 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.
You can help to correct and verify the translation. Click here for instructions.
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.
You can help to correct and verify the translation. Click here for instructions.
[modifier] 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.
