2018-08-30 07:18:55 -05:00
|
|
|
// run-pass
|
2015-02-08 21:49:27 -06:00
|
|
|
// Test that we can quantify lifetimes outside a constraint (i.e., including
|
|
|
|
// the self type) in a where clause.
|
|
|
|
|
2015-03-22 15:13:15 -05:00
|
|
|
|
2015-02-08 21:49:27 -06:00
|
|
|
static mut COUNT: u32 = 1;
|
|
|
|
|
2015-03-31 18:58:01 -05:00
|
|
|
trait Bar<'a> {
|
2015-02-08 21:49:27 -06:00
|
|
|
fn bar(&self);
|
|
|
|
}
|
|
|
|
|
2015-02-12 09:29:52 -06:00
|
|
|
trait Baz<'a>
|
|
|
|
{
|
2015-02-08 21:49:27 -06:00
|
|
|
fn baz(&self);
|
|
|
|
}
|
|
|
|
|
|
|
|
impl<'a, 'b> Bar<'b> for &'a u32 {
|
|
|
|
fn bar(&self) {
|
|
|
|
unsafe { COUNT *= 2; }
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl<'a, 'b> Baz<'b> for &'a u32 {
|
|
|
|
fn baz(&self) {
|
|
|
|
unsafe { COUNT *= 3; }
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Test we can use the syntax for HRL including the self type.
|
|
|
|
fn foo1<T>(x: &T)
|
|
|
|
where for<'a, 'b> &'a T: Bar<'b>
|
|
|
|
{
|
|
|
|
x.bar()
|
|
|
|
}
|
|
|
|
|
|
|
|
// Test we can quantify multiple bounds (i.e., the precedence is sensible).
|
|
|
|
fn foo2<T>(x: &T)
|
|
|
|
where for<'a, 'b> &'a T: Bar<'b> + Baz<'b>
|
|
|
|
{
|
|
|
|
x.baz();
|
|
|
|
x.bar()
|
|
|
|
}
|
|
|
|
|
|
|
|
fn main() {
|
2015-03-03 02:42:26 -06:00
|
|
|
let x = 42;
|
2015-02-08 21:49:27 -06:00
|
|
|
foo1(&x);
|
|
|
|
foo2(&x);
|
|
|
|
unsafe {
|
2015-06-07 13:00:38 -05:00
|
|
|
assert_eq!(COUNT, 12);
|
2015-02-08 21:49:27 -06:00
|
|
|
}
|
|
|
|
}
|