Re: building decision trees with mpl

From: Markus Werle (yg-boost-users_at_[hidden])
Date: 2003-06-04 02:56:59

David Abrahams wrote:

> You could remove the illegal "typename" in this line:
> 
>   typedef typename mpl::find_if<

incredible how sloppy compilers are ... 

> It's hard to comment further when I have no idea what it's supposed to
> be doing.  

It is supposed to do what it does :-)

My question is, whether the code above could 
be optimized regarding compile time or compactness 
or whether I missed another feature of mpl.

> Comments or a little exposition would be a big help.

The real life version is at 
http://tinyurl.com/df99

search for:

template <class WRT, int mm, int nn, class ARG>
struct DiffImpl<WRT, 
Daixt::UnOp<ARG, Daixt::DefaultOps::RationalPower<mm, nn> > >

best regards,

Markus