Re: Fusion-ifying proto parse trees

Joel de Guzman wrote:
> Eric Niebler wrote:
> > 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.

A view over a segmented sequence is itself a segmented sequence and 
would need segmented iterators. It would probably be best at this point 
to come up with some perf numbers to justify further work in this area.

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


-------------------------------------------------------
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