I can think of three ways to create a lookup table in LINQ. Strangely, they exhibit surprisingly variable performance characteristics.
The compiler often doesn't see the difference between imperative and object-oriented code, so try not to feel too bad about which one you write.
Once upon a time, a fool thought, "I know! I'll fix this problem with a regular expression." Then he had two problems.
Half of Rust is unstable. Unfortunately, it's the good half. Fortunately, there are some ways to mitigate that.
I mentioned the only real advantage of Crockford Base32 over Hashids was performance. What I did not know at the time was how big an advantage that really is.
If you haven't been keeping up with "Meltdown," I'm not going to link to it from here. I don't want to fuck up your world. No, no, don't look it up.
Bigger isn't always better. Sometimes, the small number wins. For instance, the US Army monster pictured above makes 11,000 horsepower and has a redline of 8500 RPM, but goes from zero to