Re: [boost] Accelerating algorithms with SIMD - Segmented iterators and alternatives

Subject: Re: [boost] Accelerating algorithms with SIMD - Segmented iterators and alternatives
From: Mathias Gaunard (mathias.gaunard_at_[hidden])
Date: 2010-10-14 12:49:14

On 14/10/10 16:07, Jeffrey Lee Hellrung, Jr. wrote:

> Show me what the equivalent nested for-loop looks like if a join_range
> can be "segmentedly" iterated over. If I tried, I'd be inclined to write
> a for-loop over a Boost.Fusion sequence. If you want to include a
> join_iterator within the family of segmented iterators, you'd have to
> enrich the interface of segmented iterators to include Boost.Fusion
> sequences. Is that desirable? Maybe?

It seems useful, but it wouldn't be usable for the main reason segmented 
iterators were created, deque and trees, and that concept wouldn't 
really be interoperable with segmented iterators.