Varianti

operator=,!=(std::unordered_multimap)

Da cppreference.com.

<metanoindex/>

 
 
 
std :: unordered_multimap
Membri funzioni
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
Iteratori
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
Modificatori
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
Benna interfaccia
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
Politica di Hash
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
Osservatori
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)
Confronta il contenuto di due contenitori non ordinata.
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.
Il contenuto di due contenitori non ordinata lhs e rhs sono equivalenti se le seguenti condizioni contenere:
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()
  • ogni gruppo di tasti equivalenti [lhs_eq1, lhs_eq2) ha un corrispondente gruppo di tasti equivalenti della [rhs_eq1, rhs_eq2) altro contenitore, che ha le seguenti proprietà:
    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.

Parametri

lhs, rhs -
non ordinato contenitori da confrontare
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.

Valore di ritorno

1)

true se il contenuto dei contenitori sono equivalenti, false altrimenti
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 se il contenuto dei contenitori non sono equivalenti, false altrimenti
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.

Complessità

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