|
Boost : |
From: David Abrahams (david.abrahams_at_[hidden])
Date: 2002-04-17 19:01:33
----- Original Message -----
From: "Paul Mensonides" <pmenso57_at_[hidden]>
> You also slow down compile times with extra instantiations of the
templates that
> support the abstraction between the algorithms and the lists. I think
that
> speed of compilation is more about pure number of instantiations than
the depth
> of instantiation
What is your basis for that conclusion? Are you speculating?
I happen to know that in one popular compiler implementation, name
mangling is the limiting factor, such that instantiation depth has a
direct impact on speed.
> . That compiler-defined limit is really only there to protect
> the compiler from recursing indefinitely:
But in some compilers it is hard-coded (e.g. recent CodeWarrior
releases)
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk