https://issues.dlang.org/show_bug.cgi?id=15901
Issue ID: 15901 Summary: Perfect hash map for the visual D lexer Product: D Version: D2 Hardware: All OS: Windows Status: NEW Severity: enhancement Priority: P1 Component: visuald Assignee: nob...@puremagic.com Reporter: b2.t...@gmx.com I can provide a perfect hash map for the visual D lexer (https://github.com/D-Programming-Language/visuald/blob/master/vdc/lexer.d). It would be quite similar to this one: https://github.com/BBasile/d2kw/blob/master/src/d2kw.d but with the keywords list as defined in VisualD. Maybe 256 will be a bit hard to generate but 384 or 512 will be OK. 512 is fine for a slightly faster hash. Reply or contact me if you're interested. --