sorting time_t

[Gary Wessle]

dear programmers
I am in need of some help please.
I am trying to sort vector<time_tassending.
the following is by best go but needs some guide.

struct assending : public binary_function<time_t, time_t, bool{
bool operator()(time_t x, time_t y) {
return x y;
}
}
sort(time_vec.begin(), time_vec.end(), assending());

will this be the correct way to do it?

thanks

[Alan Johnson]

Gary Wessle wrote:

dear programmers
I am in need of some help please.
I am trying to sort vector<time_tassending.
the following is by best go but needs some guide.

struct assending : public binary_function<time_t, time_t, bool{
bool operator()(time_t x, time_t y) {
return x y;
}
}
sort(time_vec.begin(), time_vec.end(), assending());

will this be the correct way to do it?

thanks

There is a standard version of your "assending" functor, called greater.
All you need to do is:

#include <algorithm>
// ...
sort(time_vec.begin(), time_vec.end(), greater<time_t>()) ;

See this link for details:
http://www.sgi.com/tech/stl/greater.html

--
Alan Johnson

[Alan Johnson]

Gary Wessle wrote:

dear programmers
I am in need of some help please.
I am trying to sort vector<time_tassending.
the following is by best go but needs some guide.

struct assending : public binary_function<time_t, time_t, bool{
bool operator()(time_t x, time_t y) {
return x y;
}
}
sort(time_vec.begin(), time_vec.end(), assending());

will this be the correct way to do it?

thanks

There is a standard version of your "assending" functor, called
greater. All you need to do is:

#include <algorithm>
// ...
sort(time_vec.begin(), time_vec.end(), greater<time_t>()) ;

See this link for details:
http://www.sgi.com/tech/stl/greater.html

--
Alan Johnson

[peter koch]

On Jan 31, 4:18 am, Gary Wessle <[e-mail]:

dear programmers
I am in need of some help please.
I am trying to sort vector<time_tassending.
the following is by best go but needs some guide.

struct assending : public binary_function<time_t, time_t, bool{
bool operator()(time_t x, time_t y) {
return x y;
}

As mentioned otherwere, this functionality is already present in the
std:: library.

>
}

sort(time_vec.begin(), time_vec.end(), assending());

will this be the correct way to do it?

No - this sorts in descending order. the correct way is
std::sort(time_vec.begin(), time_vec.end());
Plain and as simple as it can be right now.

/Peter