RE: [boost] MPL containers and algorithms

From: Aleksey Gurtovoy (agurtovoy_at_[hidden])
Date: 2002-07-29 21:57:58

Hamish Mackenzie wrote:
> > 1. Which experience are you talking about? I ask because previous
> > measurements of the compilation speed of MPL algorithms on 
> > its structures were misleading. The slowness people were seeing 
> > had mostly to do with the particular way the preprocessor library 
> > was used in the implementation (and a few other factors, I think -- 
> > Aleksey can say for sure). 
> > In any case, those issues have been addressed in the implementation 
> > under review.
> 
> I have not been keeping up with boost lately, does this apply to the
> tests that I did?  Have you repeated them with the new version? 

I didn't repeat your exact test, but can do that as well, if you are
interested.

[...]

> I have implemented BOOST_MPL_FOLD_* macros for a recursive 
> list type and I'll tidy up the code a bit and post it this week.  If the 
> new version of MPL has sorted the compile time performance problem 

There should be nothing like 10 times slowdown now. There is still more room
for improvement, of course.

Aleksey