|
Boost : |
From: Hubert Holin (Hubert.Holin_at_[hidden])
Date: 2003-05-07 09:44:50
Somewhere in the E.U., le 07/05/2003
Bonjour
In article <b9ak93$l6r$1_at_[hidden]>,
Markus Werle <numerical.simulation_at_[hidden]> wrote:
> Hi!
[SNIP]
> Questions like whether copy or reference semantics
> are appropriate or how to achieve expression simplification
> at compile time can be solved such that these features
> are truly reusable.
>
> I call this Second Generation Expression Templates.
> The core idea is to completely separate the
> parsing of an expression (and its storage in a
> corresponding type) from the lazy resp. delayed execution.
>
> The former is what can go into boost::etl, the latter is
> what is left to library writers who build code upon this
> new lib.
[SNIP]
> Please tell me whether You think that such a lib is useful
> for boost and what You think about the way I tried to solve
> Expression Template programming once for all times.
>
>
> best regards,
>
>
> Markus
I am absolutely in favour of a library which would help me add ET
with minimal work (ET are on my TODO list for quaternions and
octonions)!
Merci
Hubert Holin
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk