Comparator Classes are used to compare the objects of user-defined classes. In order to develop a generic function use template, and in order to make the function more generic use containers, so that comparisons between data can be made.
Syntax:
cpp
class comparator_class {public: // Comparator function bool operator()(object o1, object o2) { // There can be any condition // implemented as per the need // of the problem statement return (o1.data_member == o2.data_member); }} |
Explanation: The above comparator function operator() class take two pair of objects at a time and return true if data members of the two operators are the same. There can be any condition as per the need of the problem in the comparator function. In the above example, the function returns true if data members are the same. Example 1: For implementing Linear Search on the array elements, searching an integer in a given array can be implemented easily. But searching any element on user defined data type can’t be implemented easily as in case of array. In this case, the comparator class is used to implement it. Below is the program for the same:
C++
// C++ program for the Comparator Class// for implementing linear search#include <bits/stdc++.h>using namespace std;// Generic function to search for objecttemplate <class ForwardIterator, class T>ForwardIterator search( ForwardIterator start, ForwardIterator end, T key){ // Iterate until start equals to end while (start != end) { // If the value with given key is // found the return that index if (*start == key) { return start; } start++; } return end;}// Student Classclass student {public: // To store Name and Roll Number string name; int rollnum; // Overloaded Constructor student(string name, int rollnum) { this->name = name; this->rollnum = rollnum; }};// Comparator Class to compare 2 objectsclass studentcompare {public: // Comparator function bool operator()(student a, student b) { // If values are the same then // return true if (a.name == b.name) { return true; } return false; }};// Driver Codeint main(){ // Object of class student student s1("Raj", 23); student s2("Prerna", 24); // List of students list<student> s; s.push_back(s1); s.push_back(s2); // Search student("Prerna", 24) student searchstudent("Prerna", 24); studentcompare cmp; // Print if element is found if (cmp(s2, searchstudent)) { cout << "Student found!"; } else { cout << "Not found"; } return 0;} |
Student found!
Explanation:
- In the above program, a list of student objects is made in which initially 2 student objects are inserted.
- Now to search for a particular student a template linear search function is written which makes use of the comparator class.
- The comparator class compares the student to be searched from the list of students on the basis of their name attribute.
- If the name attribute of the object to be searched is equal to any of the object’s name attribute in the list then it returns true, otherwise, it returns false.
Example 2:
Let us take another example of using Comparator class for sorting, suppose the task is to sort an array of objects based on its attributes value, then the idea is to create a custom comparator class in which the function on which the sorting has to be done can be mentioned. Then, it can be passed as an argument in sort() function.
C++
// C++ program for the Comparator Class// implementing sorting#include <bits/stdc++.h>using namespace std;// Student Classclass student {public: // To store Name and Roll Number string name; int rollnum; // Overloaded Constructor student(string name, int rollnum) { this->name = name; this->rollnum = rollnum; }};// Comparator Class to compare 2 objectsclass studentcompare {public: // Comparator function bool operator()(const student& a, const student& b) { // Compare on basis of roll number if (a.rollnum < b.rollnum) { return true; } return false; }};// Driver Codeint main(){ // Object of class student student s1("Raj", 23); student s2("Prerna", 24); student s3("Harshit", 21); // List of students list<student> s; s.push_back(s1); s.push_back(s2); s.push_back(s3); // Creating object of // comparator class studentcompare cmp; // Passing the object of // comparator class to sort() s.sort(cmp); // Printing the list after sorting for (auto stu : s) { cout << stu.name << " "; } return 0;} |
Harshit Raj Prerna
Explanation:
- In the above program, a list of student objects is made in which initially 3 student objects are inserted.
- Now if the list of the student has to be sorted on the basis of the student’s rollno attribute then a custom comparator class has to be passed as an argument to the sort() function.
- In the comparator class, a predicate logic has to be mentioned which returns either true or false on the basis of which the list is sorted.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
