-
Notifications
You must be signed in to change notification settings - Fork 13.6k
Closed
Labels
A-GATsArea: Generic associated types (GATs)Area: Generic associated types (GATs)A-higher-rankedArea: Higher-ranked things (e.g., lifetimes, types, trait bounds aka HRTBs)Area: Higher-ranked things (e.g., lifetimes, types, trait bounds aka HRTBs)A-inferenceArea: Type inferenceArea: Type inferenceA-lifetimesArea: Lifetimes / regionsArea: Lifetimes / regionsA-trait-systemArea: Trait systemArea: Trait systemC-bugCategory: This is a bug.Category: This is a bug.T-compilerRelevant to the compiler team, which will review and decide on the PR/issue.Relevant to the compiler team, which will review and decide on the PR/issue.
Description
I tried this code:
#![feature(generic_associated_types)]
use std::marker::PhantomData as PhD;
pub trait Universe: 'static {
type Ty<'a>;
}
impl Universe for &'static u8 {
type Ty<'a> = &'a u8;
}
trait Service<Req> {}
struct BadCombinator<ReqU, S>(PhD<ReqU>, S);
impl<'c, ReqU, S> Service<ReqU::Ty<'c>> for BadCombinator<ReqU, S>
where
ReqU: Universe,
S: for<'a> Service<ReqU::Ty<'a>>,
S: Service<ReqU>, // swapping the last two bounds works!
{
}
fn test(svc: impl for<'a> Service<&'a u8>) {
fn assert_good(_: impl for<'a> Service<&'a u8>) {}
// assert_good(BadCombinator(PhD::<&u8>, svc)); //<- works
assert_good(BadCombinator(PhD, svc));
}
I expected to see this happen: program either compiles or requires type annotation for ReqU
.
Instead, this happened: The program fails with a message unrelated to type inference. While reording the bounds as noted or annotating for ReqU
makes it compile.
The error message looks pretty confusing as it seems that the compiler was able to infer ReqU
!
Error Output
error[[E0277]](https://doc.rust-lang.org/nightly/error-index.html#E0277): the trait bound `for<'a> impl for<'a> Service<&'a u8>: Service<<&u8 as Universe>::Ty<'a>>` is not satisfied
[--> src/lib.rs:28:17
](https://play.rust-lang.org/?version=nightly&mode=debug&edition=2021&gist=7d6db0f5036d46fc55706aed2d6eb64c#) |
28 | assert_good(BadCombinator(PhD, svc));
| ----------- ^^^^^^^^^^^^^^^^^^^^^^^ the trait `for<'a> Service<<&u8 as Universe>::Ty<'a>>` is not implemented for `impl for<'a> Service<&'a u8>`
| |
| required by a bound introduced by this call
|
note: required because of the requirements on the impl of `for<'a> Service<&'a u8>` for `BadCombinator<&u8, impl for<'a> Service<&'a u8>>`
[--> src/lib.rs:16:19
](https://play.rust-lang.org/?version=nightly&mode=debug&edition=2021&gist=7d6db0f5036d46fc55706aed2d6eb64c#) |
16 | impl<'c, ReqU, S> Service<ReqU::Ty<'c>> for BadCombinator<ReqU, S>
| ^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^^^^^^
note: required by a bound in `assert_good`
[--> src/lib.rs:25:28
](https://play.rust-lang.org/?version=nightly&mode=debug&edition=2021&gist=7d6db0f5036d46fc55706aed2d6eb64c#) |
25 | fn assert_good(_: impl for<'a> Service<&'a u8>) {}
| ^^^^^^^^^^^^^^^^^^^^^^^ required by this bound in `assert_good`
help: consider further restricting this bound
|
24 | pub fn test(svc: impl for<'a> Service<&'a u8> + for<'a> Service<<&u8 as Universe>::Ty<'a>>) {
| ++++++++++++++++++++++++++++++++++++++++++++
For more information about this error, try `rustc --explain E0277`.
error: could not compile `playground` due to previous error
Meta
Reproduced on nightly versions back to 2020-05-01
Current nightly:
1.62.0-nightly (2022-04-21 de1bc0008be096cf7ed6)
@rustbot label F-generic_associated_types A-inference T-compiler
Metadata
Metadata
Assignees
Labels
A-GATsArea: Generic associated types (GATs)Area: Generic associated types (GATs)A-higher-rankedArea: Higher-ranked things (e.g., lifetimes, types, trait bounds aka HRTBs)Area: Higher-ranked things (e.g., lifetimes, types, trait bounds aka HRTBs)A-inferenceArea: Type inferenceArea: Type inferenceA-lifetimesArea: Lifetimes / regionsArea: Lifetimes / regionsA-trait-systemArea: Trait systemArea: Trait systemC-bugCategory: This is a bug.Category: This is a bug.T-compilerRelevant to the compiler team, which will review and decide on the PR/issue.Relevant to the compiler team, which will review and decide on the PR/issue.