On Thursday, 15 December 2016 at 09:23:07 UTC, Nordlöw wrote:
On Thursday, 15 December 2016 at 09:21:10 UTC, Nordlöw wrote:
Cool, this is a crucial requirement for pattern matching in
parser generators, like Pegged and alikes. Is it worth giving
newCTFE a try with these things now?
BTW, does newCTFE string-switches use O(1) lookups?
Nope. Currently it lowers to an if else chain.
Which is O(N), though still faster then calling the runtime :)
I just fixed Assigning static arrays from ArrayLiterals.
....
And now the phobos-compiletime tests pass!
