>>368659656
Funnily enough, switch statements result in more compiler-generated IL than if-trees. The tree structure is also close to what the compiler optimizes it to. Finally, comparing byte-by-byte is actually faster than generating a hashcode and using a lookup table, which is why lexers use a similar system.

So again, cry more.