|
Boost : |
Subject: Re: [boost] [fusion] segmented fusion 2.0
From: Joel de Guzman (joel_at_[hidden])
Date: 2011-08-11 04:58:48
On 8/11/2011 12:28 PM, Eric Niebler wrote:
> I took the liberty of rewriting all my old broken segmented fusion code
> and checked in something (hopefully) a bit more maintainable and
> friendly. Along with the changes, I added an algorithm called
> segmented_fold_until. Many of the existing algorithms have segmented
> versions that can be implemented trivially in terms of this one. (Recall
> that the biggest problem with the old implementation was the need to
> write a separate implementation of every algorithm for segmented data
> structures, which was very complicated. Now that's almost trivial.)
>
> I hope in the coming weeks and months to produce segmented versions of
> most of the existing fusion algorithms. Once that's done, I hope to
> "bake it in" by making the existing algorithms select the segmented
> flavors automatically.
I've been wanting to ask you what's cookin' :), now I know.
This is awesome, Eric. Simply awesome!
> Also, some containers and views are naturally segmented, like
> joint_view. Practically all of joint_view's implementation, including
> its iterator, would vanish if it just advertised itself as segmented.
Cool! It would be interesting to see the compile time comparisons
though.
Regards,
-- Joel de Guzman http://www.boostpro.com http://boost-spirit.com
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk