Once again I'm stuck and i'm certain it's something i'm overlooking. I'm working on a project for my class that reads in a text file, builds a list based of those elements and then we're supposed to be able to manipulate that list. Everythign works except the List.Sort(). Here's the way I understand it.


Right now I'm building a list of pointers to my class objects. Inside my class i've overloaded <, >, and = to work for my objects. However, the list will not sort for me at all. I have a feeling it has something to do with the fact that the sort function works on the pointers themselves rather then the data. Here's my first question.

When you overload >, for instance and you're comparing say 2 class objects how can you get it to recieve a pointer on the left? Logically this doesn't seem to work....



So say we have a List populated with n SomeClass *'s. Would the above operator overload work for a comparison or would I have to dereference that data somehow?

After working on it a bit last night, googling lists, sorting, and pointers and every combination there of I was able to get it to work. However, im not sure I understand what is going on so if somone can explain it I would appreciate it. I want to both be able to understand and implement it.

Within my class that manages (builds, populates and manipulates) my list object I built a boolean function object (I think), that is later passed into the list.sort() function. Here's what I added...




Then later, when I called list.sort all I had to do was pass it SortProcess


I hope im explaining it right....