std::sort使用自定义比较函数

最新推荐文章于 2024-06-29 20:14:51 发布

adream307

最新推荐文章于 2024-06-29 20:14:51 发布

阅读量6.4k

点赞数

分类专栏： Linux c/c++

本文链接：https://blog.csdn.net/adream307/article/details/50485382

版权

Linux 同时被 2 个专栏收录

301 篇文章 4 订阅

订阅专栏

c/c++

213 篇文章 0 订阅

订阅专栏

//std_sort.cpp
#include<vector>
#include<algorithm>
#include<string>
#include<functional>
#include<iostream>

using namespace std;

struct Person
{
	int age;
	string name;
	Person(const int a=0,const string &n="nobody"):age(a),name(n){}
	bool operator < (const Person &rhs) const { return this->age < rhs.age; }
	bool operator > (const Person &rhs) const { return this->age > rhs.age; }
};

bool Greater(const Person &a, const Person &b)
{
	return a.age > b.age;
}

struct LesserAge: public binary_function<Person,Person,bool>
{
	inline bool operator()(const Person &a, const Person &b)
	{
		return a.age < b.age;
	}
};

int main()
{

	vector<Person> vecPerson;

	vecPerson.push_back(Person(24,"Calvin"));
	vecPerson.push_back(Person(32,"Benny"));
	vecPerson.push_back(Person(30,"Alice"));
	vecPerson.push_back(Person(28,"Alison"));
	std::sort(vecPerson.begin(),vecPerson.end());
	for(size_t i=0; i<vecPerson.size(); ++i) cout<<vecPerson[i].age<<", "<<vecPerson[i].name<<endl;
	cout << "========" << endl;
	std::sort(vecPerson.begin(),vecPerson.end(),std::greater<Person>());
	for(size_t i=0; i<vecPerson.size(); ++i) cout<<vecPerson[i].age<<", "<<vecPerson[i].name<<endl;
	cout << "========" << endl;
	std::sort(vecPerson.begin(),vecPerson.end(),LesserAge());
	for(size_t i=0; i<vecPerson.size(); ++i) cout<<vecPerson[i].age<<", "<<vecPerson[i].name<<endl;
	cout << "========" << endl;
	std::sort(vecPerson.begin(),vecPerson.end(),Greater);
	for(size_t i=0; i<vecPerson.size(); ++i) cout<<vecPerson[i].age<<", "<<vecPerson[i].name<<endl;
	cout << "========" << endl;
	return 0;
}