Re: [boost] Overload resolution speed

Subject: Re: [boost] Overload resolution speed
From: Sebastian Redl (sebastian.redl_at_[hidden])
Date: 2011-09-22 05:25:41

On 21.09.2011 20:20, Mathias Gaunard wrote:
> As part of the Boost.SIMD effort, another library was developed, 
> Boost.Dispatch, which relies heavily on overload resolution.
>
> Back to the benchmark, making the number of functions vary show an 
> apparent exponential increase in compile time. It's reasonably fast 
> for 100 functions, but not at all for 1,000.
Overload resolution is supposed to be linear in the number of overloads. 
If you can show a graph that shows super-linear increase in compile 
time, you should file a bug with the respective compilers.

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.

Sebastian