我可以将参数传递给std :: vector排序功能吗？

Question

Consider the class:

MyClass {
    int varA;
    int varB;
};

I have a vector of pointers to MyClass objects:

std::vector<MyClass*> Vec;

I want to sort the vector according to varA or varB using the same sort function, ie :

bool SortFunction(const MyClass* obj1, const MyClass* obj2, const short type) {
     if( type == VARA_ID )
         return obj1->varA < obj2->varA;
     else if( type == VARB_ID )
         return obj1->varB < obj2->varB;
}

AFAICT this is not possible. What would be the most elegant way to this without using external libraries?

Answer 1

class sorter {
      short type_;
public:
      sorter(short type) : type_(type) {}
      bool operator()(MyClass const* o1, MyClass const* o2) const {
            return SortFunction(o1, o2, type_ );
      }
};

std::sort(Vec.begin(), Vec.end(), sorter(MY_TYPE) );

Answer 2

You're almost there, make type a template parameter and the signature is OK:

template<int type>
bool SortFunction(const MyClass* obj1, const MyClass* obj2) {
     if( type == VARA_ID )
         return obj1->varA < obj2->varA;
     else // if( type == VARB_ID ) -- A sort function must have a default.
         return obj1->varB < obj2->varB;
}

std::sort(Vec.begin(), Vec.end(), &SortFunction<VARA_ID> );

The optimizer will spot that ( type == VARA_ID ) is a compile-time constant.

Answer 3

Using Boost.Lambda and without any special sorting function , right in your code where you need sorting:

Briefly

// sort with VARA_ID
sort(Vec.begin(), Vec.end(), bind(&MyClass::varA, _1)<bind(&MyClass::varA, _2));

// sort with VARB_ID
sort(Vec.begin(), Vec.end(), bind(&MyClass::varB, _1)<bind(&MyClass::varB, _2));

Full example

#include <iostream>
#include <vector>
#include <boost/lambda/lambda.hpp>
#include <boost/lambda/bind.hpp>
#include <algorithm>

using namespace boost::lambda;

class MyClass {
public:
    int varA;
    int varB;
};

enum SorterType {
    VARA_ID,
    VARB_ID 
};

int main()
{

    std::vector<MyClass*> Vec;

    Vec.push_back(new MyClass());
    Vec.push_back(new MyClass());
    Vec.push_back(new MyClass());

    Vec[0]->varA = 1; Vec[0]->varB = 8;
    Vec[1]->varA = 2; Vec[1]->varB = 7;
    Vec[2]->varA = 3; Vec[2]->varB = 6;

    // sort with VARA_ID
    std::sort(Vec.begin(), Vec.end(), 
              bind(&MyClass::varA, _1)  < bind(&MyClass::varA, _2) );

    // VARB_ID
    std::sort(Vec.begin(), Vec.end(), 
              bind(&MyClass::varB, _1)  < bind(&MyClass::varB, _2) );

    return 0;
}

Answer 4

Does the value of type change with each comparison? It cannot, as it appears. In that case, use a curried function -- see boost::bind .

std::sort(v.begin(), v.end(), boost::bind(SortFunction, _1, _2, type));

Answer 5

A more generic solution might also be to make use of pointers-to-members:

#include <vector>
#include <algorithm>
#include <functional>

struct MyClass {
    int varA;
    int varB;
};

template <class Object, class VarType>
class CompareMemberT: public std::binary_function<bool, const Object*, const Object*>
{
    VarType Object::*p;
public:
    CompareMemberT(VarType Object::*p): p(p) {}
    bool operator()(const Object* a, const Object* b) const
    {
        return a->*p < b->*p;
    }
};

//helper to deduce template arguments
template <class Object, class VarType>
CompareMemberT<Object, VarType> CompareMember(VarType Object::*p)
{
    return CompareMemberT<Object, VarType>(p);
}

int main()
{
    std::vector<MyClass*> vec;
    std::sort(vec.begin(), vec.end(), CompareMember(&MyClass::varA));
    std::sort(vec.begin(), vec.end(), CompareMember(&MyClass::varB));
}