Bug 15901 – Perfect hash map for the visual D lexer

Status
RESOLVED
Resolution
LATER
Severity
enhancement
Priority
P1
Component
visuald
Product
D
Version
D2
Platform
All
OS
Windows
Creation time
2016-04-09T07:21:00Z
Last change time
2016-04-29T03:34:11Z
Assigned to
nobody
Creator
b2.temp

Comments

Comment #0 by b2.temp — 2016-04-09T07:21:37Z
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.