Subject: Re: [boost] combinations and permutations
From: Howard Hinnant (howard.hinnant_at_[hidden])
Date: 2011-01-05 15:04:04
On Jan 5, 2011, at 2:45 PM, Howard Hinnant wrote:
> It doesn't seem to be any slower! :-)
Correction: If the compiler can see that the functor always returns false it isn't any slower. If it can't (separate compilation unit, or whatever), there's about a 12% speed hit.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk