Join GitHub today
GitHub is home to over 28 million developers working together to host and review code, manage projects, and build software together.Sign up
Added a simple automata to read member names #47
added a commit
this pull request
Aug 17, 2014
In testing this appears to be faster than hashing (in addition to being faster than dictionary lookups).
I haven't quite removed all of the hashing code though. It's still used in enum matching (as you've noted) and matching anonymous member names.
Anonymous types are a little fun since we have to create them via their constructor, rather than setting the properties after using the default constructor.
Removing the rest of hashing would be a good follow up PR.