a little bit of style-cleanup
refactor this into a method, to finally TODONE this ancient TODO
get started on smarter individual character matching in NameAutomata
speed proof test for switches; looks like it's actually *not* faster... which is interesting
speed proof for binary search; which does appear to be faster, though veeeeery marginally
eliminate the switch case in NameAutomata; it's not an optimization
use the binary search char matcher in automata in all cases where it's actually more efficient; eschew a hard coded switch over, actually do the math