|
Boost : |
From: David Abrahams (david.abrahams_at_[hidden])
Date: 2002-06-29 17:34:20
----- Original Message -----
From: "Itay Maman" <itay_maman_at_[hidden]>
>
> I believe that mpl should supply some sort of 'lite' list (no matter
> what is the underlying implementation) which does not put such a heavy
> weight on the compiler. Ideally, this list would support mpl::list's
> interface, or (at least) a subset of it.
mpl::list is just a dot-style typelist with a interface-simplifying wrapper
on top. I am fairly certain that there is little or no overhead due to the
structure of mpl::list itself. Rather, I think the generality of the
algorithm implementations tend to make them slower than neccessary when
applied to type lists. This can be solved as similar problems are solved in
STL, by specializing the algorithms to operate efficiently on the target
structures.
-Dave
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk