diff options
| author | Matthias Krüger <matthias.krueger@famsik.de> | 2023-12-14 20:33:10 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2023-12-14 20:33:10 +0100 |
| commit | accaea27955ca30fc8c5e2bacd10b3094e89eee8 (patch) | |
| tree | 13bcb7ea5cb26b45142c966e30852cef8b33eebc /compiler/rustc_pattern_analysis | |
| parent | 9ec620546f185d3776f312a0b0949bb2612500e6 (diff) | |
| parent | 929d632b541cb52c23e1b768bb8c3f88bf9b5955 (diff) | |
| download | rust-accaea27955ca30fc8c5e2bacd10b3094e89eee8.tar.gz rust-accaea27955ca30fc8c5e2bacd10b3094e89eee8.zip | |
Rollup merge of #118914 - compiler-errors:eager-alias-relate, r=lcnr
Unconditionally register alias-relate in projection goal Follow-up to #118725, which subtly broke closure signature inference on combinators like `Result::map` which I noticed in syn. Essentially, instead of using `eq` which will eagerly infer `?1 := <?2 as Trait>::Assoc`, we can directly emit an alias-relate goal, which will stay ambiguous for as long as `?2` is ambiguous. This also more closely models the conceptual framing that projects-to acts like an alias-relate when solving, and like a normalizes-to when in a param env. r? lcnr
Diffstat (limited to 'compiler/rustc_pattern_analysis')
0 files changed, 0 insertions, 0 deletions
