Re: [boost] [sort] pdqsort

Subject: Re: [boost] [sort] pdqsort
From: Norbert Wenzel (norbert.wenzel.lists_at_[hidden])
Date: 2017-01-14 10:09:49

On 01/13/2017 07:49 PM, Steven Ross wrote:
> I see these possible things to do with pdqsort:
> 1) Reject it completely as too similar to std::sort, which is already
> highly optimized.
> 2) Add it as another optional library in the Boost.Sort library.
> 3) Add it to Boost.Sort, and only use it as a fallback for ints and floats.
> 4) Add it to Boost.Sort, use it as a fallback for all of spreadsort, and
> have pdqsort itself only use its branch-reduction optimization on ints and
> floats.
> 5) #4, except eliminate the branch-reduction optimization completely from
> pdqsort for simplicity.
> 
> Does anyone have a strong preference, advice, or comments on how they use
> Boost.Sort?

I don't have a *strong* preference, but if easily possible I prefer
option 2 so I can make my own measurements and decide whether I want to
use pdqsort. If you additionally add it as a fallback to default
spreadsort for whatever cases you figure out it works reasonably better
than std::sort I'd consider this a plus.

Norbert