Re: Sorting STL lists
* Erik Wikstr?m:
On 2007-07-14 16:29, Tim Frink wrote:
Hi,
I need some help with STL lists.
I've a list with pointers to some objects,
let's say std::list< ObjectA* > myList.
The objects of the class ObjectA all have a
function "int getIntValue()". What I need
now is to sort all elements of "myList" by the
return value of "getIntValue()", i.e. after sorting
the first element in the list will be the one with
the smallest return value of "getIntValue()" ... and
the last obviously with the largest.
Could you give me some hints how to do that?
You have to create a comparator function, something like
bool cmp(const ObjectA* a, const ObjectA* b)
{
return a->getIntValue() < b->getIntValeu();
}
Yes.
and then use
std::sort(list.begin(), list.end(), cmp);
No, std::sort is not guaranteed to forward to std::list::sort.
You need to use std::list::sort.
--
A: Because it messes up the order in which people normally read text.
Q: Why is it such a bad thing?
A: Top-posting.
Q: What is the most annoying thing on usenet and in e-mail?