D compile time algorithms implementation

[Peter Alexander]

On Saturday, 20 April 2013 at 06:07:18 UTC, khurshid wrote:
> Why more linear algorithms implemented with O(N^2) ?
> example: staticMap,  it doesnot compiled  more 500 arguments.

I guess the simple answer is that their complexity hasn't been 
given much thought, as I don't image they were intended to be 
used with that many arguments (of course, this is not an excuse).

If possible, could you file an enhancement request? It would also 
be great if you could add your improvement as a pull request on 
github!

http://d.puremagic.com/issues/enter_bug.cgi?product=D
https://github.com/D-Programming-Language/phobos