From f0eebcd02f1dd123c0ff4e8ddf04a520cc1cf2a4 Mon Sep 17 00:00:00 2001 From: Niko Matsakis Date: Mon, 3 Jun 2019 15:54:21 -0400 Subject: integrate pick constraints into lexical solver more completely --- src/test/ui/impl-trait/multiple-lifetimes/inverse-bounds.rs | 3 --- 1 file changed, 3 deletions(-) (limited to 'src/test/ui/impl-trait') diff --git a/src/test/ui/impl-trait/multiple-lifetimes/inverse-bounds.rs b/src/test/ui/impl-trait/multiple-lifetimes/inverse-bounds.rs index 41d4b59e8f0..60275ac3ab0 100644 --- a/src/test/ui/impl-trait/multiple-lifetimes/inverse-bounds.rs +++ b/src/test/ui/impl-trait/multiple-lifetimes/inverse-bounds.rs @@ -13,9 +13,6 @@ impl Trait<'_, '_> for T {} struct Invert<'a>(fn(&'a u8)); fn upper_bounds<'a, 'b, 'c, 'd, 'e>(a: Invert<'a>, b: Invert<'b>) -> impl Trait<'d, 'e> -//~^ ERROR hidden type for `impl Trait` captures lifetime that does not appear in bounds -// FIXME -- we ought to be able to pick `'d` here, but our handling of in constraints -// is not smart enough where 'c: 'a, 'c: 'b, -- cgit 1.4.1-3-g733a5