recursive-patterns(7): improve generated code for switch

recursive-patterns(6): Build and use decision tree to lower pattern-matching operations

And add documentation.

Merge master into features/recursive-patterns

Fixes #9121

Fixes #16616

Fixes #20641

Fixes #19153

Fixes #19150

Fixes #15437

Fixes #22654

Fixes #12813

Fixes #16878

Add a test to demonstrate that pattern-matching against a decimal constant is
at least as efficient as simply using ==

- Add a new bound node to represent the dispatch of a switch statement, and use it for a sequence of value tests in the pattern switch.
- Generate a string switch using a hash code (as before) for a pattern switch.
- Remove much of the old switch binder, except what is still used.
- Fix wrong `InputType` recorded for BoundRecursivePattern.
- Prevent cascaded subsumption errors from erroneous patterns.
- Make the bound node factory use BoundSwitchDispatch rather than BoundSwitchStatement.
- Remove obsolete bound nodes from previous switch implementation.

Lower the decision dag in topological order
Handle matching long tuples by using a lowering helper
Use ValueOrDefault() when possible in pattern lowering

Merge from features/compiler into features/recursive-patterns