-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcomparator.cpp
52 lines (41 loc) · 969 Bytes
/
comparator.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
/*
Universal comparator
https://ideone.com/jI536i
*/
#include <iostream>
#include <vector>
#include <algorithm>
class MyClass
{
public:
struct
{
bool operator()(int a, int b)
{
return a < b;
}
} myUniversalComparator;
void mysort(std::vector<int> &vec)
{
std::sort(vec.begin(), vec.end(), myUniversalComparator); // as sort comparator
}
bool mycompare(int a, int b)
{
return myUniversalComparator(a, b);
}
};
int main()
{
MyClass myclass;
std::vector<int> vec = { 1,8,3,9,2 };
// as std::sort comparator
myclass.mysort(vec);
for (auto n : vec)
std::cout << n << " ";
std::cout << std::endl;
// as in class method invocation
std::cout << vec[0] << " < " << vec[2] << " -> " << std::boolalpha << myclass.mycompare(vec[0], vec[2]) << std::endl;
// as class method direct invocation
std::cout << vec[4] << " < " << vec[3] << " -> " << std::boolalpha << myclass.myUniversalComparator(vec[4], vec[3]) << std::endl;
return 0;
}