Re: Fusion-ifying proto parse trees

Eric Niebler wrote:
> 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. :-)

Thanks! I'm perusing the code now. This would be a good addition
to Fusion. I wonder how algorithms that return views would look
like, or if they are as efficient as suggested.

Regards,
--
Joel de Guzman
http://www.boost-consulting.com
http://spirit.sf.net



-------------------------------------------------------
Using Tomcat but need to do more? Need to support web services, security?
Get stuff done quickly with pre-integrated technology to make your job easier
Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo
http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642