Re: Fusion-ifying proto parse trees

Joel de Guzman wrote:
> Eric Niebler wrote:
> > Joel de Guzman wrote:
> > > Eric Niebler wrote:
> > > > I'm going to spend some time thinking about segmented Fusion 
> > > > algorithms, because I think that's where we'll get the most bang for 
> > > > our buck.
> > >
> > > That would be awesome!
> >
> > Working on it.
>
> Double awesome! This is exciting!


In the attached archive is:

segmented.hpp  - The Fusion primitives needed to work with segmented
                 Fusion iterators.

for_each_s.hpp - A segmented implementation of the for_each algorithm

main.cpp       - The implementation of segmented view/iterators for
                 binary proto trees.

The segmented algorithm looks complicated, but fortunately, I think all 
the algorithms will follow a similar pattern, so we should be able to 
crank them out without too much fuss. It is perfectly general and will 
work with any segmented data structure, not just binary trees, assuming 
you give it suitably defined iterators.

I have no performance numbers, but I have a good feeling about it. :-)


--
Eric Niebler
Boost Consulting
www.boost-consulting.com

segmented-fusion.tar.gz
Description: GNU Zip compressed data