function template
<unordered_map>

# std::operators (unordered_multimap)

equality (1) ```template bool operator== ( const unordered_multimap& lhs, const unordered_multimap& rhs ); ``` ```template bool operator!= ( const unordered_multimap& lhs, const unordered_multimap& rhs ); ```
Relational operators for unordered_multimap
These overloaded global operator functions perform the appropriate equality or inequality comparison operation between the unordered_multimap containers lhs and rhs.

The procedure for the equality comparison is as follows (stopping at any point if the procedure finds a conclusive answer):

### Parameters

lhs, rhs
unordered_multimap containers (to the left- and right-hand side of the operator, respectively), having both the same template parameters (Key, T, Hash, Pred and Alloc).

### Return Value

true if the condition holds, and false otherwise.

### Example

 ``123456789101112131415161718`` ``````// unordered_multimap comparisons #include #include #include typedef std::unordered_multimap stringmap; int main () { stringmap a = { {"AAPL",100}, {"MSFT",200}, {"GOOG",50}, {"GOOG",20} }; stringmap b = { {"GOOG",20}, {"MSFT",200}, {"AAPL",100}, {"GOOG",50} }; stringmap c = { {"GOOG",70}, {"MSFT",200}, {"AAPL",100} }; if (a==b) std::cout << "a and b are equal\n"; if (b!=c) std::cout << "b and c are not equal\n"; return 0; }``````

Output:
 ```a and b are equal b and c are not equal ```

### Complexity

Average case: linear in number of equivalent groups, where each is up to quadratic in number of elements (general case), but commonly linear if the relative order of elements between the equivalent groups is the same (such as when a container is a copy of another).