@@ -129,7 +129,7 @@ impl<I: Interner> AggregateOps<I> for SlgContextOps<'_, I> {
129
129
/// u32` and the new answer is `?0 = i32`, then the guidance would
130
130
/// become `?0 = ?X` (where `?X` is some fresh variable).
131
131
fn merge_into_guidance < I : Interner > (
132
- interner : & I ,
132
+ interner : I ,
133
133
root_goal : & Canonical < InEnvironment < Goal < I > > > ,
134
134
guidance : Canonical < Substitution < I > > ,
135
135
answer : & Canonical < ConstrainedSubst < I > > ,
@@ -184,7 +184,7 @@ fn merge_into_guidance<I: Interner>(
184
184
infer. canonicalize ( interner, aggr_subst) . quantified
185
185
}
186
186
187
- fn is_trivial < I : Interner > ( interner : & I , subst : & Canonical < Substitution < I > > ) -> bool {
187
+ fn is_trivial < I : Interner > ( interner : I , subst : & Canonical < Substitution < I > > ) -> bool {
188
188
// A subst is trivial if..
189
189
subst
190
190
. value
@@ -226,13 +226,13 @@ fn is_trivial<I: Interner>(interner: &I, subst: &Canonical<Substitution<I>>) ->
226
226
/// inference variables.
227
227
///
228
228
/// [Anti-unification]: https://en.wikipedia.org/wiki/Anti-unification_(computer_science)
229
- struct AntiUnifier < ' infer , ' intern , I : Interner > {
229
+ struct AntiUnifier < ' infer , I : Interner > {
230
230
infer : & ' infer mut InferenceTable < I > ,
231
231
universe : UniverseIndex ,
232
- interner : & ' intern I ,
232
+ interner : I ,
233
233
}
234
234
235
- impl < I : Interner > AntiUnifier < ' _ , ' _ , I > {
235
+ impl < I : Interner > AntiUnifier < ' _ , I > {
236
236
fn aggregate_tys ( & mut self , ty0 : & Ty < I > , ty1 : & Ty < I > ) -> Ty < I > {
237
237
let interner = self . interner ;
238
238
match ( ty0. kind ( interner) , ty1. kind ( interner) ) {
@@ -587,7 +587,7 @@ mod test {
587
587
let mut anti_unifier = AntiUnifier {
588
588
infer : & mut infer,
589
589
universe : UniverseIndex :: root ( ) ,
590
- interner : & ChalkIr ,
590
+ interner : ChalkIr ,
591
591
} ;
592
592
593
593
let ty = anti_unifier. aggregate_tys (
@@ -601,7 +601,7 @@ mod test {
601
601
#[ test]
602
602
fn vec_i32_vs_vec_i32 ( ) {
603
603
use chalk_integration:: interner:: ChalkIr ;
604
- let interner = & ChalkIr ;
604
+ let interner = ChalkIr ;
605
605
let mut infer: InferenceTable < ChalkIr > = InferenceTable :: new ( ) ;
606
606
let mut anti_unifier = AntiUnifier {
607
607
interner,
@@ -620,7 +620,7 @@ mod test {
620
620
#[ test]
621
621
fn vec_x_vs_vec_y ( ) {
622
622
use chalk_integration:: interner:: ChalkIr ;
623
- let interner = & ChalkIr ;
623
+ let interner = ChalkIr ;
624
624
let mut infer: InferenceTable < ChalkIr > = InferenceTable :: new ( ) ;
625
625
let mut anti_unifier = AntiUnifier {
626
626
interner,
0 commit comments