Subject: Re: [boost] [parallel_sort] Proposal
From: Andrey Semashev (andrey.semashev_at_[hidden])
Date: 2009-02-03 12:21:47
Edouard A. wrote:
>> That's a lot of extra copying.
> [Edouard A.]
> I don't do in place merge. I don't know if this would be faster.
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.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk