1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
|
// Test that we don't hit the recursion limit for short cycles involving lifetimes.
// Shouldn't hit this, we should realize that we're in a cycle sooner.
#![recursion_limit="20"]
trait NotAuto {}
trait Y {
type P;
}
impl<'a> Y for C<'a> {
type P = Box<X<C<'a>>>;
}
struct C<'a>(&'a ());
struct X<T: Y>(T::P);
impl<T: NotAuto> NotAuto for Box<T> {}
impl<T: Y> NotAuto for X<T> where T::P: NotAuto {} //~ NOTE: required
//~^ NOTE unsatisfied trait bound introduced here
impl<'a> NotAuto for C<'a> {}
fn is_send<S: NotAuto>() {}
//~^ NOTE: required
//~| NOTE: required
fn main() {
// Should only be a few notes.
is_send::<X<C<'static>>>();
//~^ ERROR overflow evaluating
}
|
