about summary refs log tree commit diff
path: root/compiler/rustc_mir_transform/src/coverage/debug.rs
diff options
context:
space:
mode:
authorMatthias Krüger <matthias.krueger@famsik.de>2023-07-22 19:57:36 +0200
committerGitHub <noreply@github.com>2023-07-22 19:57:36 +0200
commit8f4b81b14631a63a024dfd0f66e9977d4c7c8487 (patch)
tree74fe1f8448b52dbccb9d6f2645864ae9ca2e504c /compiler/rustc_mir_transform/src/coverage/debug.rs
parent0ed5f091a630a8f2812645e9a2d439a3b081a561 (diff)
parente32011209d185a12575c90929c13211936a3f421 (diff)
downloadrust-8f4b81b14631a63a024dfd0f66e9977d4c7c8487.tar.gz
rust-8f4b81b14631a63a024dfd0f66e9977d4c7c8487.zip
Rollup merge of #113901 - compiler-errors:only-bidi-norm, r=lcnr
Get rid of subst-relate incompleteness in new solver

We shouldn't need subst-relate if we have bidirectional-normalizes-to in the new solver.

The only potential issue may happen if we have an unconstrained projection like `<Wrapper<?0> as Trait>::Assoc == <Wrapper<T> as Trait>::Assoc` where they both normalize to something that doesn't mention any substs, which would possibly prefer `?0 = T` if we fall back to subst-relate. But I'd prefer if we remove incompleteness until we can determine some case where we need them, and the bidirectional-normalizes-to seems better to have in general.

I can update https://github.com/rust-lang/trait-system-refactor-initiative/issues/26 and https://github.com/rust-lang/trait-system-refactor-initiative/issues/25 once this lands.

r? `@lcnr`
Diffstat (limited to 'compiler/rustc_mir_transform/src/coverage/debug.rs')
0 files changed, 0 insertions, 0 deletions