Re: [Boost-users] performance of template expression

From: Sohail Somani (s.somani_at_[hidden])
Date: 2006-07-31 11:39:20

> -----Original Message-----
> From: boost-users-bounces_at_[hidden] 
> [mailto:boost-users-bounces_at_[hidden]] On Behalf Of 
> divyank shukla
> Sent: Monday, July 31, 2006 8:06 AM
> To: boost-users_at_[hidden]
> Subject: [Boost-users] performance of template expression
> 
> snip....
> 
> My question is does the performance penalty still
> exist with g++(4.1) compilers as against boost::lambda
> functions.

Where are your performance results (hard numbers)? Have you measured
them as compared to the rest of your algorithm? For example, if you do
the general QR decomposition, chances are that's going to be the slow
part.

One should usually profile after coding, rather than optimizing
prematurely. Generally it's the algorithm that is slow.