Re: [boost] [iterator] std::sort on zip_iterator (repost)

Subject: Re: [boost] [iterator] std::sort on zip_iterator (repost)
From: Steven Ross (spreadsort_at_[hidden])
Date: 2009-05-10 12:34:18

On Sun, May 10, 2009 at 8:37 AM, Edouard A. <edouard_at_[hidden]> wrote:

> I can do it. I can add a wrapper to spread sort as well. The idea is to
> give
> as many bricks as possible with some default constructions for the user who
> isn't interested in dwelling to much in the details. That's an approach I
> like. Simple and satisfactory default behavior with the possibility for
> heavy customization.
>
> I'll have some time next week and guess what, I have a new rig to
> benchmark!
>
> When I returned from Aspen I found on the threshold of my door an abandoned
> Core i7 and 12 GB of RAM with a letter saying "take good care of them".
>
> Oh yeah. >)
>

Sounds good to me.
I might have to modify spreadsort a bit to make it work reasonably
efficiently with bidirectional iterators, but it's doable.
You may want to consider keeping track of counts instead of calculating
distance.