On Monday, 4 February 2013 at 00:22:42 UTC, Brian Schott wrote:
After several hours of optimizing I've managed to make it so
that dmd's lexer is only three times faster.
http://hackerpilot.github.com/experimental/std_lexer/images/times.png
The funny thing is that compiling with LDC gave a bigger speed
boost than any of my code refacatoring.
Where is the current bottleneck?
(Should be easy to find just by running the program ~5 times and
suddenly breaking into it with a debugger.)
Also, I'm assuming you've already tried disabling range-checking
on arrays?
