How We Made a 128-Arm Pattern Match Run 10 Faster

How We Made a 128-Arm Pattern Match Run 10× Faster The 128-branch dispatch problem, and the compile-time optimization system that solved it. Pattern matching is coming to C++ — eventually. C++26 might bring it. But if you're writing C++17 today and need to match on variants, enums, or arbitrary values with guards, destructuring, and combinators, you're on your own. I've been building Patternia , a C++17 header-only pattern matching library, for the past year. The API is simple enough: #include u