std::list.sort( compFunc ) error

[Tim Partridge]

I have a std list of student objects and I would like to sort them by
providing a comparison function. I have gotten it to work if my function
is global, but I would like to encapsulate it in a class. For example, my
attempt below fails, but if I move sortFunctor out of the class, it will
compile.

#include <list>
using namespace std;

class foo {
public:
foo(int i) : i(i) {};
~foo() {};
int i;

// compiles if this in the global namespace
bool sortFunctor(con st foo &f1, const foo &f2) {
return (f1.i < f2.i);
}
};

int main() {
list< foo > l;
foo f1(8);
foo f2(3);

l.push_back(f1) ;
l.push_back(f2) ;

// compiles if foo:: is removed
l.sort(foo::sor tFunctor);

return 0;
}

Regards,
Tim Partridge

[Karl Heinz Buchegger]

Tim Partridge wrote:

I have a std list of student objects and I would like to sort them by
providing a comparison function. I have gotten it to work if my function
is global, but I would like to encapsulate it in a class. For example, my
attempt below fails, but if I move sortFunctor out of the class, it will
compile.
The trick is, that this class needs an operator()

#include <list>
using namespace std;

class foo {
public:
foo(int i) : i(i) {};
~foo() {};
int i;

// compiles if this in the global namespace
bool sortFunctor(con st foo &f1, const foo &f2) {
bool operator() ( const foo& f1, const foo& f2 ) {
return (f1.i < f2.i);
}
};

int main() {
list< foo > l;
foo f1(8);
foo f2(3);

l.push_back(f1) ;
l.push_back(f2) ;

// compiles if foo:: is removed
l.sort(foo::sor tFunctor);
l.sort( foo() );

return 0;
}

--
Karl Heinz Buchegger
kb******@gascad .at

[Jeff Flinn]

"Karl Heinz Buchegger" <kb******@gasca d.at> wrote in message
news:40******** *******@gascad. at...

Tim Partridge wrote:

I have a std list of student objects and I would like to sort them by
providing a comparison function. I have gotten it to work if my function
is global, but I would like to encapsulate it in a class. For example, my attempt below fails, but if I move sortFunctor out of the class, it will
compile.
The trick is, that this class needs an operator()

Why?

#include <list>
using namespace std;

class foo {
public:
foo(int i) : i(i) {};
~foo() {};
int i;

// compiles if this in the global namespace
bool sortFunctor(con st foo &f1, const foo &f2) {

bool operator() ( const foo& f1, const foo& f2 ) {

return (f1.i < f2.i);
}
What state from (*this) is being used here?

The only thing missing from the OP's class declaration/definition is that
sortFunctor should be static. I would rename sortFunctor to Compare, as it
is not a Functor, and it really just compares to foo's.

Better yet would be to make i private, and provide operator<. That way you
could just call l.sort().

Jeff F
};

int main() {
list< foo > l;
foo f1(8);
foo f2(3);

l.push_back(f1) ;
l.push_back(f2) ;

// compiles if foo:: is removed
l.sort(foo::sor tFunctor);

l.sort( foo() );

return 0;
}

--
Karl Heinz Buchegger
kb******@gascad .at

[Karl Heinz Buchegger]

Jeff Flinn wrote:

"Karl Heinz Buchegger" <kb******@gasca d.at> wrote in message
news:40******** *******@gascad. at...

Tim Partridge wrote:

I have a std list of student objects and I would like to sort them by
providing a comparison function. I have gotten it to work if my function
is global, but I would like to encapsulate it in a class. For example, my attempt below fails, but if I move sortFunctor out of the class, it will
compile.
The trick is, that this class needs an operator()

Why?

Because the OP wanted to create a Functor. And a functor
is a class, which has such an operator.

#include <list>
using namespace std;

class foo {
public:
foo(int i) : i(i) {};
~foo() {};
int i;

// compiles if this in the global namespace
bool sortFunctor(con st foo &f1, const foo &f2) {
bool operator() ( const foo& f1, const foo& f2 ) {

return (f1.i < f2.i);
}

What state from (*this) is being used here?

None.
A Functor is an object that can be used in templates when a function
is required.

The only thing missing from the OP's class declaration/definition is that
sortFunctor should be static.

Thats a bad idea in the general case although it works in this
specific case.

--
Karl Heinz Buchegger
kb******@gascad .at

[Karl Heinz Buchegger]

Jeff Flinn wrote:

Dear Jeff. Please disregard my previous post.

After reareading the OP post, I noticed that I completely
read a different program then was written down by the OP.

Somehow I got the expression, that the OP wanted to create
a functor class named foo.
Only after rereading I noticed that foo is the class the OP
builds his list with.
Sorry for the confusion.

--
Karl Heinz Buchegger
kb******@gascad .at

[Karl Heinz Buchegger]

Karl Heinz Buchegger wrote:

Jeff Flinn wrote:

Dear Jeff. Please disregard my previous post.

After reareading the OP post, I noticed that I completely
read a different program then was written down by the OP.

Somehow I got the expression, that the OP wanted to create

typed to quick: ... got the impression, ...
--
Karl Heinz Buchegger
kb******@gascad .at

[Jeff Flinn]

"Karl Heinz Buchegger" <kb******@gasca d.at> wrote in message
news:40******** *******@gascad. at...

Jeff Flinn wrote:

Dear Jeff. Please disregard my previous post.

After reareading the OP post, I noticed that I completely
read a different program then was written down by the OP.

Somehow I got the expression, that the OP wanted to create
a functor class named foo.
Only after rereading I noticed that foo is the class the OP
builds his list with.

Keine Probleme.

The OP's choice of name "sortFuncto r" didn't help.

Jeff F