What Is Pattern Matching?

Pattern matching is a control construct that tests a value against a series of patterns describing possible shapes, runs the branch for the first that fits, and binds the matched sub-values to names. It combines case selection with destructuring in a single readable form. It is especially powerful with algebraic data types, where each variant can be a pattern.

Why it matters

Pattern matching replaces nested conditionals and manual field extraction with clear, declarative branches. Combined with exhaustiveness checking, it ensures every possible case is handled.

Related guides