Chaining of ordering predicates (e.g. for std::sort)

Question

You can pass a function pointer, function object (or boost lambda) to std::sort to define a strict weak ordering of the elements of the container you want sorted.

Howeve

Answer 1

You can try this:

Usage:

struct Citizen {
    std::wstring iFirstName;
    std::wstring iLastName;
};

ChainComparer cmp;
cmp.Chain( boost::bind( &Citizen::iLastName, _1 ) );
cmp.Chain( boost::bind( &Citizen::iFirstName, _1 ) );

std::vector vec;
std::sort( vec.begin(), vec.end(), cmp );

Implementation:

template 
class ChainComparer {
public:

    typedef boost::function TComparator;
    typedef TComparator EqualComparator;
    typedef TComparator CustomComparator;

    template