template< class Key, class Hash, class KeyEqual, class Allocator > bool operator==( const unordered_set<Key,Hash,KeyEqual,Allocator>& lhs, const unordered_set<Key,Hash,KeyEqual,Allocator>& rhs ); | (1) | |
template< class Key, class Hash, class KeyEqual, class Allocator > bool operator!=( const unordered_set<Key,Hash,KeyEqual,Allocator>& lhs, const unordered_set<Key,Hash,KeyEqual,Allocator>& rhs ); | (2) |
Compares the contents of two unordered containers.
The contents of two unordered containers lhs
and rhs
are equal if the following conditions hold:
lhs.size() == rhs.size()
[lhs_eq1, lhs_eq2)
obtained from lhs.equal_range(lhs_eq1)
has a corresponding group of equivalent elements in the other container [rhs_eq1, rhs_eq2)
obtained from rhs.equal_range(rhs_eq1)
, that has the following properties: std::distance(lhs_eq1, lhs_eq2) == std::distance(rhs_eq1, rhs_eq2)
. std::is_permutation(lhs_eq1, lhs_eq2, rhs_eq1) == true
. The behavior is undefined if Key
is not EqualityComparable
.
The behavior is also undefined if Hash and KeyEqual do not have the same behavior on lhs and rhs or if operator==
for value_type
is not a refinement of the partition into equivalent-key groups introduced by KeyEqual (that is, if two elements that compare equal using operator==
fall into different partitions).
lhs, rhs | - | unordered containers to compare |
true
if the contents of the containers are equal, false
otherwisetrue
if the contents of the containers are not equal, false
otherwiseProportional to N calls to operator==
on value_type
, calls to the predicate returned by key_eq, and calls to the hasher returned by hash_function, in the average case, proportional to N^{2} in the worst case where N is the size of the container.
© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
http://en.cppreference.com/w/cpp/container/unordered_set/operator_cmp