Re: [boost] [parallel_sort] Proposal

Subject: Re: [boost] [parallel_sort] Proposal
From: Edouard A. (edouard_at_[hidden])
Date: 2009-02-03 12:34:25

On Tue, 03 Feb 2009 20:21:47 +0300, Andrey Semashev
<andrey.semashev_at_[hidden]> wrote:

> May I suggest to store iterators in the allocated storage? After sorting
> the iterators you could merge them and then apply sorting by simply
> swapping the elements of the original sequence. If the elements are fat
> and support fast swapping, this might give some speed.

Thanks for the idea, I already got a lot of feedback and I have a lot of
work ahead of me. :)

-- 
EA