#include <iostream>
#include <string>
#include <deque>
#include <set>
#include <algorithm>
using namespace std;
class Person {
private:
string fn; string ln; public:
Person() {
}
Person(const string& f, const string& n)
: fn(f), ln(n) {
}
string firstname() const;
string lastname() const;
};
inline string Person::firstname() const {
return fn;
}
inline string Person::lastname() const {
return ln;
}
ostream& operator<< (ostream& s, const Person& p)
{
s << "[" << p.firstname() << " " << p.lastname() << "]";
return s;
}
bool personSortCriterion (const Person& p1, const Person& p2)
{
return p1.lastname()<p2.lastname() ||
(!(p2.lastname()<p1.lastname()) &&
p1.firstname()<p2.firstname());
}
int main()
{
Person p1("nicolai","josuttis");
Person p2("ulli","josuttis");
Person p3("anica","josuttis");
Person p4("lucas","josuttis");
Person p5("lucas","otto");
Person p6("lucas","arm");
Person p7("anica","holle");
deque<Person> coll;
coll.push_back(p1);
coll.push_back(p2);
coll.push_back(p3);
coll.push_back(p4);
coll.push_back(p5);
coll.push_back(p6);
coll.push_back(p7);
cout << "deque before sort():" << endl;
deque<Person>::iterator pos;
for (pos = coll.begin(); pos != coll.end(); ++pos) {
cout << *pos << endl;
}
sort(coll.begin(),coll.end(), personSortCriterion);
cout << "deque after sort():" << endl;
for (pos = coll.begin(); pos != coll.end(); ++pos) {
cout << *pos << endl;
}
}