2018-08-30 07:18:55 -05:00
|
|
|
// run-pass
|
2018-09-25 16:51:35 -05:00
|
|
|
#![allow(dead_code)]
|
|
|
|
#![allow(unused_variables)]
|
2014-07-22 06:46:36 -05:00
|
|
|
// This is an example where the older inference algorithm failed. The
|
|
|
|
// specifics of why it failed are somewhat, but not entirely, tailed
|
|
|
|
// to the algorithm. Ultimately the problem is that when computing the
|
|
|
|
// mutual supertype of both sides of the `if` it would be faced with a
|
|
|
|
// choice of tightening bounds or unifying variables and it took the
|
|
|
|
// wrong path. The new algorithm avoids this problem and hence this
|
|
|
|
// example typechecks correctly.
|
|
|
|
|
2015-03-22 15:13:15 -05:00
|
|
|
// pretty-expanded FIXME #23616
|
|
|
|
|
2014-07-22 06:46:36 -05:00
|
|
|
enum ScopeChain<'a> {
|
|
|
|
Link(Scope<'a>),
|
|
|
|
End
|
|
|
|
}
|
|
|
|
|
|
|
|
type Scope<'a> = &'a ScopeChain<'a>;
|
|
|
|
|
|
|
|
struct OuterContext;
|
|
|
|
|
|
|
|
struct Context<'a> {
|
|
|
|
foo: &'a OuterContext
|
|
|
|
}
|
|
|
|
|
|
|
|
impl<'a> Context<'a> {
|
|
|
|
fn foo(&mut self, scope: Scope) {
|
2015-01-25 15:05:03 -06:00
|
|
|
let link = if 1 < 2 {
|
2014-11-06 02:05:53 -06:00
|
|
|
let l = ScopeChain::Link(scope);
|
2014-07-22 06:46:36 -05:00
|
|
|
self.take_scope(&l);
|
|
|
|
l
|
|
|
|
} else {
|
2014-11-06 02:05:53 -06:00
|
|
|
ScopeChain::Link(scope)
|
2014-07-22 06:46:36 -05:00
|
|
|
};
|
|
|
|
self.take_scope(&link);
|
|
|
|
}
|
|
|
|
|
|
|
|
fn take_scope(&mut self, x: Scope) {
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn main() { }
|