File: wf-eval-order.rs

package info (click to toggle)
rustc 1.86.0%2Bdfsg1-1
  • links: PTS, VCS
  • area: main
  • in suites: experimental, forky, sid
  • size: 913,560 kB
  • sloc: xml: 158,127; python: 35,921; javascript: 19,689; sh: 19,600; cpp: 18,906; ansic: 13,124; asm: 4,376; makefile: 708; perl: 29; lisp: 29; ruby: 19; sql: 11
file content (39 lines) | stat: -rw-r--r-- 738 bytes parent folder | download | duplicates (7)
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
// Check that we handle evaluating `wf` predicates correctly.

//@ check-pass

struct X<T: B>(T)
where
    T::V: Clone;

fn hide<T>(t: T) -> impl Sized {
    t
}

trait A {
    type U;
}

impl<T> A for T {
    type U = T;
}

trait B {
    type V;
}

impl<S: A<U = T>, T> B for S {
    type V = T;
}

fn main() {
    // Evaluating `typeof(x): Sized` requires
    //
    // - `wf(typeof(x))` because we use a projection candidate.
    // - `<i32 as B>::V: Clone` because that's a bound on the trait.
    // - `<i32 as B>::V` normalizes to `?1t` where `<i32 as A>::U == ?1t`
    //
    // This all works if we evaluate `<i32 as A>::U == ?1t` before
    // `<i32 as B>::V`, but we previously had the opposite order.
    let x = hide(X(0));
}