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

Binding but not lowering and code gen for the switch expression.

Merge dev15.7.x to features/compiler

Implement a generic topological sort algorithm

recursive-patterns(5): Respond to code review comments in #23208 and #23209, #23228, and #23357

Switch to UIAComWrapper for integration test interop

Support expression bodied properties in "use auto property" analyzer.

Call the correct (non boxing) Equals method

Fixes #17680
Fixes #21154
Improves #17393

Fix build break

Looks like two PRs had incompatible changes. This cleans it up.

Refactor PR: Visual Basic Test Helpers 2