Dereference Adaptor

[Matthias Kaeppler]

Hello,

I need to sort a range of pointers with a predicate which applies to the
pointees. I tried to use boost::indirect _iterator, however, this will
sort the container with the pointees instead the one with the pointers:

vector<int> coll;
// ...
vector<int*> ptrcoll;
// ...
indirect_iterat or< vector<int*>::i terator > begin(ptrcoll.b egin()),
end(ptrcoll.end ());

sort( begin, end ); // this sorts coll, not ptrcoll, what have I gained?

Instead, is there some sort of adaptor, which allows things like this:

vector<int> coll;
// ...
vector<int*> ptrcoll;
// ...
sort( ptrcoll.begin() , ptrcoll.end(), dereference( less<int>() ) );

.... where dereference is an adaptor taking the function/functor
representing the predicate on the pointees.

--
Matthias Kaeppler

[Kurt Krueckeberg]

I need to sort a range of pointers with a predicate which applies to the
pointees. I tried to use boost::indirect _iterator, however, this will sort
the container with the pointees instead the one with the pointers:

vector<int> coll;
// ...
vector<int*> ptrcoll;
sort( ptrcoll.begin() , ptrcoll.end(), dereference( less<int>() ) );

template<typena me T> class DerefPtr {
T *t_;
public:
DerefPtr(T *x) : t_(x) {}
T operator *() const;
};

vector<Ptr<int> > ptrcoll;
sort( ptrcoll.begin() , ptrcoll.end(), less<int>() );

[Matthias Kaeppler]

Kurt Krueckeberg wrote:

I need to sort a range of pointers with a predicate which applies to the
pointees. I tried to use boost::indirect _iterator, however, this will sort
the container with the pointees instead the one with the pointers:

vector<int> coll;
// ...
vector<int* > ptrcoll;
sort( ptrcoll.begin() , ptrcoll.end(), dereference( less<int>() ) );

template<typena me T> class DerefPtr {
T *t_;
public:
DerefPtr(T *x) : t_(x) {}
T operator *() const;
};

vector<Ptr<int> > ptrcoll;
sort( ptrcoll.begin() , ptrcoll.end(), less<int>() );

And what is this supposed to do? ^^
operator* has no body. And I guess vector<Ptr<int> > is supposed to be
vector<DerefPtr <int> > ?

--
Matthias Kaeppler

[Kurt Krueckeberg]

And what is this supposed to do? ^^
operator* has no body. And I guess vector<Ptr<int> > is supposed to be
vector<DerefPtr <int> > ?

Sorry for the confusion.

#include "stdafx.h"
#include <vector>
#include <functional>
#include <algorithm>
#include <iterator>
using namespace std;

// Comparison functor for use with associative containers
struct DereferenceLess {
public:
template<typena me PtrType> bool operator()(PtrT ype pT1, PtrType pT2)
{
return *pT1 < *pT2;
}
};

struct Dereference {
template<typena me T> const T& operator()(cons t T* ptr) const
{
return *ptr;
}
};

int main(int argc, char *argv[])
{

int *pi3 = new int(8);
int *pi = new int(10);
int *pi2 = new int(9);

int *pi4 = new int(7);

vector<int* > vec;
vec.push_back(p i);
vec.push_back(p i2);
vec.push_back(p i3);
vec.push_back(p i4);
sort(vec.begin( ), vec.end(), DereferenceLess ());
transform(vec.b egin(), vec.end(), ostream_iterato r<int>(cout, "\n"),
Dereference() );

set<int *, DereferenceLess > s;
s.insert(pi1);
s.insert(pi2);
s.insert(pi3);
s.insert(pi4);

transform(vec.b egin(), vec.end(), ostream_iterato r<int>(cout, "\n"),
Dereference() );
return 0;
}