2018-08-30 12:18:55 +00:00
|
|
|
// run-pass
|
2015-02-09 03:49:27 +00:00
|
|
|
// Test that we can quantify lifetimes outside a constraint (i.e., including
|
|
|
|
// the self type) in a where clause.
|
|
|
|
|
2015-03-22 20:13:15 +00:00
|
|
|
|
2015-02-09 03:49:27 +00:00
|
|
|
static mut COUNT: u32 = 1;
|
|
|
|
|
2015-03-31 23:58:01 +00:00
|
|
|
trait Bar<'a> {
|
2015-02-09 03:49:27 +00:00
|
|
|
fn bar(&self);
|
|
|
|
}
|
|
|
|
|
2015-02-12 15:29:52 +00:00
|
|
|
trait Baz<'a>
|
|
|
|
{
|
2015-02-09 03:49:27 +00: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 08:42:26 +00:00
|
|
|
let x = 42;
|
2015-02-09 03:49:27 +00:00
|
|
|
foo1(&x);
|
|
|
|
foo2(&x);
|
|
|
|
unsafe {
|
2015-06-07 18:00:38 +00:00
|
|
|
assert_eq!(COUNT, 12);
|
2015-02-09 03:49:27 +00:00
|
|
|
}
|
|
|
|
}
|