File: builtin-closure-like-bounds.rs

package info (click to toggle)
rustc 1.89.0%2Bdfsg1-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 906,624 kB
  • sloc: xml: 158,148; python: 34,888; javascript: 19,595; sh: 19,221; ansic: 13,046; cpp: 7,144; asm: 4,376; makefile: 692; lisp: 174; sql: 15
file content (57 lines) | stat: -rw-r--r-- 1,243 bytes parent folder | download | duplicates (14)
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
//@ edition:2024
//@ revisions: current next
//@[next] compile-flags: -Znext-solver
//@ check-pass

// Makes sure that we support closure/coroutine goals where the signature of
// the item references higher-ranked lifetimes from the *predicate* binder,
// not its own internal signature binder.
//
// This was fixed in <https://github.com/rust-lang/rust/pull/122267>.

#![feature(unboxed_closures, gen_blocks)]

trait Dispatch {
    fn dispatch(self);
}

struct Fut<T>(T);
impl<T: for<'a> Fn<(&'a (),)>> Dispatch for Fut<T>
where
    for<'a> <T as FnOnce<(&'a (),)>>::Output: Future,
{
    fn dispatch(self) {
        (self.0)(&());
    }
}

struct Gen<T>(T);
impl<T: for<'a> Fn<(&'a (),)>> Dispatch for Gen<T>
where
    for<'a> <T as FnOnce<(&'a (),)>>::Output: Iterator,
{
    fn dispatch(self) {
        (self.0)(&());
    }
}

struct Closure<T>(T);
impl<T: for<'a> Fn<(&'a (),)>> Dispatch for Closure<T>
where
    for<'a> <T as FnOnce<(&'a (),)>>::Output: Fn<(&'a (),)>,
{
    fn dispatch(self) {
        (self.0)(&())(&());
    }
}

fn main() {
    async fn foo(_: &()) {}
    Fut(foo).dispatch();

    gen fn bar(_: &()) {}
    Gen(bar).dispatch();

    fn uwu<'a>(x: &'a ()) -> impl Fn(&'a ()) { |_| {} }
    Closure(uwu).dispatch();
}