tests/ui/recursion/issue-38591-non-regular-dropck-recursion.rs


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

// `S` is infinitely recursing so it's not possible to generate a finite
// drop impl (ignoring polymorphization).
//
// Dropck should therefore detect that this is the case and eagerly error.

struct S<T> {
    t: T,
    s: Box<S<fn(u: T)>>,
}

fn f(x: S<u32>) {} //~ ERROR overflow while adding drop-check rules for S<u32>

fn main() {
    // Force instantiation.
    f as fn(_);
}