Subject: Re: [boost] Accelerating algorithms with SIMD - Segmented iterators and alternatives
From: Mathias Gaunard (mathias.gaunard_at_[hidden])
Date: 2010-10-14 14:52:15
On 13/10/10 21:19, David Abrahams wrote:
> where's that list of algorithms again? sort, transform, merge,
> binary_search ...
There is no problem implementing transform, binary_search, or even sort
if you assumed it worked with forward iterators.
And I still very much doubt you can have a correct behaviour of
std::merge for segmented iterators in the face or recursively segmented
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk