unordered_set == operator in C++ STL

The ‘==’ is an operator in C++ STL performs equality comparison operation between two unordered sets and unordered_set::operator== is the corresponding operator function for the same.

Syntax:

(unordered_set &uset1 == unordered_set &uset2)

Parameters: This operator function takes reference of two unordered sets uset1 and uset2 as parameters which are to be compared.



Return Value: This method returns a boolean result value after comparing the two sets. The comparison procedure is as follows:

  • Firstly their sizes are compared .
  • Then each element in ust1 is looked for in ust2

If both the conditions are satisfied true value is returned and at any point if a condition is not satisfied, false value is returned.

Below program illustrates unordered_set::operator== in C++.

Program:

filter_none

edit
close

play_arrow

link
brightness_4
code

#include <iostream>
#include <unordered_set>
using namespace std;
  
int main()
{
    // Initilize three unordered sets
    unordered_set<int>
        sample1 = { 10, 20, 30, 40, 50 };
    unordered_set<int>
        sample2 = { 10, 30, 50, 40, 20 };
    unordered_set<int>
        sample3 = { 10, 20, 30, 50, 60 };
  
    // Compare sample1 and sample2
    if (sample1 == sample2) {
  
        cout << "sample1 and "
             << "sample2 are equal."
             << endl;
    }
    else {
  
        cout << "sample1 and "
             << "sample2 are not equal."
             << endl;
    }
  
    // Compare sample2 and sample3
    if (sample2 == sample3) {
  
        cout << "sample2 and "
             << "sample3 are equal."
             << endl;
    }
    else {
  
        cout << "sample2 and "
             << "sample3 are not equal."
             << endl;
    }
  
    return 0;
}

chevron_right


Output:

sample1 and sample2 are equal.
sample2 and sample3 are not equal.


My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.




Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.