|
|
Boost : |
Subject: Re: [boost] Overload resolution speed
From: Dave Abrahams (dave_at_[hidden])
Date: 2011-09-22 11:57:13
on Thu Sep 22 2011, Sebastian Redl <sebastian.redl-AT-getdesigned.at> wrote:
> Overload resolution is supposed to be linear in the number of
> overloads.
According to whom?
> If you can show a graph that shows super-linear increase in compile
> time, you should file a bug with the respective compilers.
Probably.
> In general, all algorithms in a compiler should be linear, or worst
> case n*log(n). Any quadratic or worse algorithm is pretty much a bug.
I'd like to think so, too, but I'm not sure all implementors would agree
with you.
-- Dave Abrahams BoostPro Computing http://www.boostpro.com
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk