81
81
/// encountered when folding. By default, invokes
82
82
/// `super_fold_with`, which will in turn invoke the more
83
83
/// specialized folding methods below, like `fold_free_var_ty`.
84
- fn fold_ty ( & mut self , ty : & Ty < I > , outer_binder : DebruijnIndex ) -> Fallible < Ty < TI > > {
84
+ fn fold_ty ( & mut self , ty : Ty < I > , outer_binder : DebruijnIndex ) -> Fallible < Ty < TI > > {
85
85
ty. super_fold_with ( self . as_dyn ( ) , outer_binder)
86
86
}
87
87
91
91
/// specialized folding methods below, like `fold_free_var_lifetime`.
92
92
fn fold_lifetime (
93
93
& mut self ,
94
- lifetime : & Lifetime < I > ,
94
+ lifetime : Lifetime < I > ,
95
95
outer_binder : DebruijnIndex ,
96
96
) -> Fallible < Lifetime < TI > > {
97
97
lifetime. super_fold_with ( self . as_dyn ( ) , outer_binder)
@@ -103,7 +103,7 @@ where
103
103
/// specialized folding methods below, like `fold_free_var_const`.
104
104
fn fold_const (
105
105
& mut self ,
106
- constant : & Const < I > ,
106
+ constant : Const < I > ,
107
107
outer_binder : DebruijnIndex ,
108
108
) -> Fallible < Const < TI > > {
109
109
constant. super_fold_with ( self . as_dyn ( ) , outer_binder)
@@ -112,14 +112,14 @@ where
112
112
/// Invoked for every program clause. By default, recursively folds the goals contents.
113
113
fn fold_program_clause (
114
114
& mut self ,
115
- clause : & ProgramClause < I > ,
115
+ clause : ProgramClause < I > ,
116
116
outer_binder : DebruijnIndex ,
117
117
) -> Fallible < ProgramClause < TI > > {
118
118
clause. super_fold_with ( self . as_dyn ( ) , outer_binder)
119
119
}
120
120
121
121
/// Invoked for every goal. By default, recursively folds the goals contents.
122
- fn fold_goal ( & mut self , goal : & Goal < I > , outer_binder : DebruijnIndex ) -> Fallible < Goal < TI > > {
122
+ fn fold_goal ( & mut self , goal : Goal < I > , outer_binder : DebruijnIndex ) -> Fallible < Goal < TI > > {
123
123
goal. super_fold_with ( self . as_dyn ( ) , outer_binder)
124
124
}
125
125
@@ -348,7 +348,7 @@ pub trait Fold<I: Interner, TI: TargetInterner<I> = I>: Debug {
348
348
/// we encounter `Binders<T>` in the IR or other similar
349
349
/// constructs.
350
350
fn fold_with < ' i > (
351
- & self ,
351
+ self ,
352
352
folder : & mut dyn Folder < ' i , I , TI > ,
353
353
outer_binder : DebruijnIndex ,
354
354
) -> Fallible < Self :: Result >
@@ -363,7 +363,7 @@ pub trait Fold<I: Interner, TI: TargetInterner<I> = I>: Debug {
363
363
pub trait SuperFold < I : Interner , TI : TargetInterner < I > = I > : Fold < I , TI > {
364
364
/// Recursively folds the value.
365
365
fn super_fold_with < ' i > (
366
- & self ,
366
+ self ,
367
367
folder : & mut dyn Folder < ' i , I , TI > ,
368
368
outer_binder : DebruijnIndex ,
369
369
) -> Fallible < Self :: Result >
@@ -379,7 +379,7 @@ impl<I: Interner, TI: TargetInterner<I>> Fold<I, TI> for Ty<I> {
379
379
type Result = Ty < TI > ;
380
380
381
381
fn fold_with < ' i > (
382
- & self ,
382
+ self ,
383
383
folder : & mut dyn Folder < ' i , I , TI > ,
384
384
outer_binder : DebruijnIndex ,
385
385
) -> Fallible < Self :: Result >
@@ -398,7 +398,7 @@ where
398
398
TI : TargetInterner < I > ,
399
399
{
400
400
fn super_fold_with < ' i > (
401
- & self ,
401
+ self ,
402
402
folder : & mut dyn Folder < ' i , I , TI > ,
403
403
outer_binder : DebruijnIndex ,
404
404
) -> Fallible < Ty < TI > >
@@ -509,7 +509,7 @@ impl<I: Interner, TI: TargetInterner<I>> Fold<I, TI> for Lifetime<I> {
509
509
type Result = Lifetime < TI > ;
510
510
511
511
fn fold_with < ' i > (
512
- & self ,
512
+ self ,
513
513
folder : & mut dyn Folder < ' i , I , TI > ,
514
514
outer_binder : DebruijnIndex ,
515
515
) -> Fallible < Self :: Result >
@@ -527,7 +527,7 @@ where
527
527
TI : TargetInterner < I > ,
528
528
{
529
529
fn super_fold_with < ' i > (
530
- & self ,
530
+ self ,
531
531
folder : & mut dyn Folder < ' i , I , TI > ,
532
532
outer_binder : DebruijnIndex ,
533
533
) -> Fallible < Lifetime < TI > >
@@ -568,7 +568,7 @@ impl<I: Interner, TI: TargetInterner<I>> Fold<I, TI> for Const<I> {
568
568
type Result = Const < TI > ;
569
569
570
570
fn fold_with < ' i > (
571
- & self ,
571
+ self ,
572
572
folder : & mut dyn Folder < ' i , I , TI > ,
573
573
outer_binder : DebruijnIndex ,
574
574
) -> Fallible < Self :: Result >
@@ -586,7 +586,7 @@ where
586
586
TI : TargetInterner < I > ,
587
587
{
588
588
fn super_fold_with < ' i > (
589
- & self ,
589
+ self ,
590
590
folder : & mut dyn Folder < ' i , I , TI > ,
591
591
outer_binder : DebruijnIndex ,
592
592
) -> Fallible < Const < TI > >
@@ -627,7 +627,7 @@ impl<I: Interner, TI: TargetInterner<I>> Fold<I, TI> for Goal<I> {
627
627
type Result = Goal < TI > ;
628
628
629
629
fn fold_with < ' i > (
630
- & self ,
630
+ self ,
631
631
folder : & mut dyn Folder < ' i , I , TI > ,
632
632
outer_binder : DebruijnIndex ,
633
633
) -> Fallible < Self :: Result >
@@ -642,7 +642,7 @@ impl<I: Interner, TI: TargetInterner<I>> Fold<I, TI> for Goal<I> {
642
642
/// Superfold folds recursively.
643
643
impl < I : Interner , TI : TargetInterner < I > > SuperFold < I , TI > for Goal < I > {
644
644
fn super_fold_with < ' i > (
645
- & self ,
645
+ self ,
646
646
folder : & mut dyn Folder < ' i , I , TI > ,
647
647
outer_binder : DebruijnIndex ,
648
648
) -> Fallible < Self :: Result >
@@ -666,7 +666,7 @@ impl<I: Interner, TI: TargetInterner<I>> Fold<I, TI> for ProgramClause<I> {
666
666
type Result = ProgramClause < TI > ;
667
667
668
668
fn fold_with < ' i > (
669
- & self ,
669
+ self ,
670
670
folder : & mut dyn Folder < ' i , I , TI > ,
671
671
outer_binder : DebruijnIndex ,
672
672
) -> Fallible < Self :: Result >
0 commit comments