summaryrefslogtreecommitdiffstats
path: root/tests/ui/methods/method-recursive-blanket-impl.rs
blob: a2db75b4e85d821c4165c4b5a29fad6684d30438 (plain)
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
// run-pass
#![allow(unused_variables)]
#![allow(unused_imports)]
// Test that we don't trigger on the blanket impl for all `&'a T` but
// rather keep autoderefing and trigger on the underlying impl.  To
// know not to stop at the blanket, we have to recursively evaluate
// the `T:Foo` bound.

// pretty-expanded FIXME #23616

use std::marker::Sized;

// Note: this must be generic for the problem to show up
trait Foo<A> {
    fn foo(&self, a: A);
}

impl Foo<u8> for [u8] {
    fn foo(&self, a: u8) {}
}

impl<'a, A, T> Foo<A> for &'a T where T: Foo<A> {
    fn foo(&self, a: A) {
        Foo::foo(*self, a)
    }
}

trait Bar {
    fn foo(&self);
}

struct MyType;

impl Bar for MyType {
    fn foo(&self) {}
}

fn main() {
    let mut m = MyType;
    (&mut m).foo()
}