On Tuesday, 24 January 2017 at 15:16:29 UTC, Nordlöw wrote:
On Tuesday, 24 January 2017 at 14:16:10 UTC, Stefan Koch wrote:
There will be NO permanence improvement for pegged.
For the 7th time.
It is bogged down by templates, ctfe is not the problem there.
Sorry for that. Got it.
What's the essence of this suboptimal performance when using
templates?
Non-O(1) lookup times?
Mangling?
The lookup time is one issue but not the most important,
The instanciation of a template is a non-trivial operation within
the compiler.
Type-deduction ast rewriting expression expansion
all of that takes time and a huge chunk at that.
Also binary code needs to be generated and that code is generated
for every instance regardless of how similar they are.