about summary refs log tree commit diff
path: root/compiler/rustc_pattern_analysis/src/errors.rs
diff options
context:
space:
mode:
authorGuillaume Boisseau <Nadrieril@users.noreply.github.com>2024-03-02 20:13:23 +0100
committerGitHub <noreply@github.com>2024-03-02 20:13:23 +0100
commit30976fbe2b961a0c2f13e3aeb14a1a5b28b3f882 (patch)
tree578cae5be76f312841febc99d0257da6502edc0b /compiler/rustc_pattern_analysis/src/errors.rs
parentb0ca9b5d445ea049f447c9fa03878922311f3c4a (diff)
parent00497ad24bcef346b2324ae4ad7b7c68315272c0 (diff)
downloadrust-30976fbe2b961a0c2f13e3aeb14a1a5b28b3f882.tar.gz
rust-30976fbe2b961a0c2f13e3aeb14a1a5b28b3f882.zip
Rollup merge of #121716 - Nadrieril:simple-binding-order, r=matthewjasper
match lowering: Lower bindings in a predictable order

After the recent refactorings, we can now lower bindings in a truly predictable order. The order in https://github.com/rust-lang/rust/pull/120214 was an improvement but not very clear. With this PR, we lower bindings from left to right, with the special case that `x @ pat` is traversed as `pat @ x` (i.e. `x` is lowered after any bindings in `pat`).

This description only applies in the absence of or-patterns. Or-patterns make everything complicated, because the binding place depends on the subpattern. Until I have a better idea I leave them to be handled in whatever weird order arises from today's code.

r? `@matthewjasper`
Diffstat (limited to 'compiler/rustc_pattern_analysis/src/errors.rs')
0 files changed, 0 insertions, 0 deletions