STL set of Classes

[creativeinspiration]

Hey Everybody. Does anybody know which operators need to be implemented in order to make the stl set of those objects works? For example I have a class myclass, and I want to have set<myclass> myclass_set where I can insert objects into the myclass_set. Any idea is cool.

[weaknessforcats]

The set is an associate container ( a tree) where the keys must be unique.

Read the docs carefully. The comparison function must be a binary predicate.

A binary predicate is a function with two arguments of the set type that returns a bool true if the first argument is less than the second argument.

Your choices are:

1) Write an operator< for the class used in the container.
MyClass::operator<(MyClass rhs) const
Remember, with membr functions, the compiler supplies the this object
as the first argument.
2) Otherwise, write an independent operator<:
bool operator<(const MyClass& lhs, const MyClass& rhs);
3) Otherwise, write a function of any name that takes two arguments of the
class used in the set that returns a bool and supply the address of this
function when you create the set container.