1 // Test that we don't hit the recursion limit for short cycles involving lifetimes.
3 // Shouldn't hit this, we should realize that we're in a cycle sooner.
4 #![recursion_limit="20"]
11 impl<'a> Y for C<'a> {
12 type P = Box<X<C<'a>>>;
18 impl<T: NotAuto> NotAuto for Box<T> {} //~ NOTE: required
19 //~^ NOTE unsatisfied trait bound introduced here
20 impl<T: Y> NotAuto for X<T> where T::P: NotAuto {}
21 impl<'a> NotAuto for C<'a> {}
23 fn is_send<S: NotAuto>() {}
28 // Should only be a few notes.
29 is_send::<X<C<'static>>>();
30 //~^ ERROR overflow evaluating
31 //~| 3 redundant requirements hidden