
2 Mar
2009
2 Mar
'09
2:35 p.m.
vicente.botet wrote:
I have implemented a parallel sort with the threadpool library
Hi Vicente, I have not tried to totally understand your code, but can you explain:
partition<Range> parts(range, BOOST_PARTS);
return boost::inplace_merge(rng, boost::begin(rng)+(boost::size(rng)/2));
Is this right when BOOST_PARTS != 2 ? Phil.