operator=,!=(std::unordered_multimap)
Da 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) | |
Compara o conteúdo de dois recipientes desordenada.
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.
O conteúdo de dois recipientes
lhs desordenada e rhs são equivalentes se as seguintes condições espera: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()
- cada grupo de chaves equivalentes
[lhs_eq1, lhs_eq2)tem um grupo correspondente de chaves equivalentes no[rhs_eq1, rhs_eq2)outro recipiente, que tem as seguintes propriedades: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.
[editar] Parâmetros
| lhs, rhs | - | desordenada recipientes para comparar
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. |
[editar] Valor de retorno
1)true se os conteúdos dos recipientes são equivalentes, false contrário
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 se o conteúdo dos recipientes não são equivalentes, false contrário
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.
[editar] Complexidade
Σ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.
