@@ -9,14 +9,14 @@ use crate::{
9
9
DebruijnIndex , FloatTy , FnDefId , ForeignDefId , GeneratorId , GenericArg , Goals , ImplId , IntTy ,
10
10
Interner , Mutability , OpaqueTyId , PlaceholderIndex , ProgramClause , ProgramClauses ,
11
11
QuantifiedWhereClauses , QuantifierKind , Safety , Scalar , Substitution , TraitId ,
12
- TypeSuperVisitable , TypeVisitable , UintTy , UniverseIndex , Visitor ,
12
+ TypeSuperVisitable , TypeVisitable , TypeVisitor , UintTy , UniverseIndex ,
13
13
} ;
14
14
use std:: { marker:: PhantomData , sync:: Arc } ;
15
15
16
16
/// Convenience function to visit all the items in the iterator it.
17
17
pub fn visit_iter < ' i , T , I , B > (
18
18
it : impl Iterator < Item = T > ,
19
- visitor : & mut dyn Visitor < I , BreakTy = B > ,
19
+ visitor : & mut dyn TypeVisitor < I , BreakTy = B > ,
20
20
outer_binder : DebruijnIndex ,
21
21
) -> ControlFlow < B >
22
22
where
32
32
impl < T : TypeVisitable < I > , I : Interner > TypeVisitable < I > for & T {
33
33
fn visit_with < B > (
34
34
& self ,
35
- visitor : & mut dyn Visitor < I , BreakTy = B > ,
35
+ visitor : & mut dyn TypeVisitor < I , BreakTy = B > ,
36
36
outer_binder : DebruijnIndex ,
37
37
) -> ControlFlow < B > {
38
38
T :: visit_with ( self , visitor, outer_binder)
@@ -42,7 +42,7 @@ impl<T: TypeVisitable<I>, I: Interner> TypeVisitable<I> for &T {
42
42
impl < T : TypeVisitable < I > , I : Interner > TypeVisitable < I > for Vec < T > {
43
43
fn visit_with < B > (
44
44
& self ,
45
- visitor : & mut dyn Visitor < I , BreakTy = B > ,
45
+ visitor : & mut dyn TypeVisitor < I , BreakTy = B > ,
46
46
outer_binder : DebruijnIndex ,
47
47
) -> ControlFlow < B > {
48
48
visit_iter ( self . iter ( ) , visitor, outer_binder)
@@ -52,7 +52,7 @@ impl<T: TypeVisitable<I>, I: Interner> TypeVisitable<I> for Vec<T> {
52
52
impl < T : TypeVisitable < I > , I : Interner > TypeVisitable < I > for & [ T ] {
53
53
fn visit_with < B > (
54
54
& self ,
55
- visitor : & mut dyn Visitor < I , BreakTy = B > ,
55
+ visitor : & mut dyn TypeVisitor < I , BreakTy = B > ,
56
56
outer_binder : DebruijnIndex ,
57
57
) -> ControlFlow < B > {
58
58
visit_iter ( self . iter ( ) , visitor, outer_binder)
@@ -62,7 +62,7 @@ impl<T: TypeVisitable<I>, I: Interner> TypeVisitable<I> for &[T] {
62
62
impl < T : TypeVisitable < I > , I : Interner > TypeVisitable < I > for Box < T > {
63
63
fn visit_with < B > (
64
64
& self ,
65
- visitor : & mut dyn Visitor < I , BreakTy = B > ,
65
+ visitor : & mut dyn TypeVisitor < I , BreakTy = B > ,
66
66
outer_binder : DebruijnIndex ,
67
67
) -> ControlFlow < B > {
68
68
T :: visit_with ( self , visitor, outer_binder)
@@ -72,7 +72,7 @@ impl<T: TypeVisitable<I>, I: Interner> TypeVisitable<I> for Box<T> {
72
72
impl < T : TypeVisitable < I > , I : Interner > TypeVisitable < I > for Arc < T > {
73
73
fn visit_with < B > (
74
74
& self ,
75
- visitor : & mut dyn Visitor < I , BreakTy = B > ,
75
+ visitor : & mut dyn TypeVisitor < I , BreakTy = B > ,
76
76
outer_binder : DebruijnIndex ,
77
77
) -> ControlFlow < B > {
78
78
T :: visit_with ( self , visitor, outer_binder)
@@ -82,7 +82,7 @@ impl<T: TypeVisitable<I>, I: Interner> TypeVisitable<I> for Arc<T> {
82
82
macro_rules! tuple_visit {
83
83
( $( $n: ident) ,* ) => {
84
84
impl <$( $n: TypeVisitable <I >, ) * I : Interner > TypeVisitable <I > for ( $( $n, ) * ) {
85
- fn visit_with<BT >( & self , visitor: & mut dyn Visitor <I , BreakTy = BT >, outer_binder: DebruijnIndex ) -> ControlFlow <BT > {
85
+ fn visit_with<BT >( & self , visitor: & mut dyn TypeVisitor <I , BreakTy = BT >, outer_binder: DebruijnIndex ) -> ControlFlow <BT > {
86
86
#[ allow( non_snake_case) ]
87
87
let & ( $( ref $n) ,* ) = self ;
88
88
$(
@@ -102,7 +102,7 @@ tuple_visit!(A, B, C, D, E);
102
102
impl < T : TypeVisitable < I > , I : Interner > TypeVisitable < I > for Option < T > {
103
103
fn visit_with < B > (
104
104
& self ,
105
- visitor : & mut dyn Visitor < I , BreakTy = B > ,
105
+ visitor : & mut dyn TypeVisitor < I , BreakTy = B > ,
106
106
outer_binder : DebruijnIndex ,
107
107
) -> ControlFlow < B > {
108
108
match self {
@@ -115,7 +115,7 @@ impl<T: TypeVisitable<I>, I: Interner> TypeVisitable<I> for Option<T> {
115
115
impl < I : Interner > TypeVisitable < I > for GenericArg < I > {
116
116
fn visit_with < B > (
117
117
& self ,
118
- visitor : & mut dyn Visitor < I , BreakTy = B > ,
118
+ visitor : & mut dyn TypeVisitor < I , BreakTy = B > ,
119
119
outer_binder : DebruijnIndex ,
120
120
) -> ControlFlow < B > {
121
121
let interner = visitor. interner ( ) ;
@@ -126,7 +126,7 @@ impl<I: Interner> TypeVisitable<I> for GenericArg<I> {
126
126
impl < I : Interner > TypeVisitable < I > for Substitution < I > {
127
127
fn visit_with < B > (
128
128
& self ,
129
- visitor : & mut dyn Visitor < I , BreakTy = B > ,
129
+ visitor : & mut dyn TypeVisitor < I , BreakTy = B > ,
130
130
outer_binder : DebruijnIndex ,
131
131
) -> ControlFlow < B > {
132
132
let interner = visitor. interner ( ) ;
@@ -137,7 +137,7 @@ impl<I: Interner> TypeVisitable<I> for Substitution<I> {
137
137
impl < I : Interner > TypeVisitable < I > for Goals < I > {
138
138
fn visit_with < B > (
139
139
& self ,
140
- visitor : & mut dyn Visitor < I , BreakTy = B > ,
140
+ visitor : & mut dyn TypeVisitor < I , BreakTy = B > ,
141
141
outer_binder : DebruijnIndex ,
142
142
) -> ControlFlow < B > {
143
143
let interner = visitor. interner ( ) ;
@@ -152,7 +152,7 @@ macro_rules! const_visit {
152
152
impl <I : Interner > $crate:: visit:: TypeVisitable <I > for $t {
153
153
fn visit_with<B >(
154
154
& self ,
155
- _visitor: & mut dyn ( $crate:: visit:: Visitor <I , BreakTy = B >) ,
155
+ _visitor: & mut dyn ( $crate:: visit:: TypeVisitor <I , BreakTy = B >) ,
156
156
_outer_binder: DebruijnIndex ,
157
157
) -> ControlFlow <B > {
158
158
ControlFlow :: Continue ( ( ) )
@@ -183,7 +183,7 @@ macro_rules! id_visit {
183
183
impl <I : Interner > $crate:: visit:: TypeVisitable <I > for $t<I > {
184
184
fn visit_with<B >(
185
185
& self ,
186
- _visitor: & mut dyn ( $crate:: visit:: Visitor <I , BreakTy = B >) ,
186
+ _visitor: & mut dyn ( $crate:: visit:: TypeVisitor <I , BreakTy = B >) ,
187
187
_outer_binder: DebruijnIndex ,
188
188
) -> ControlFlow <B > {
189
189
ControlFlow :: Continue ( ( ) )
@@ -205,7 +205,7 @@ id_visit!(ForeignDefId);
205
205
impl < I : Interner > TypeSuperVisitable < I > for ProgramClause < I > {
206
206
fn super_visit_with < B > (
207
207
& self ,
208
- visitor : & mut dyn Visitor < I , BreakTy = B > ,
208
+ visitor : & mut dyn TypeVisitor < I , BreakTy = B > ,
209
209
outer_binder : DebruijnIndex ,
210
210
) -> ControlFlow < B > {
211
211
let interner = visitor. interner ( ) ;
@@ -217,7 +217,7 @@ impl<I: Interner> TypeSuperVisitable<I> for ProgramClause<I> {
217
217
impl < I : Interner > TypeVisitable < I > for ProgramClauses < I > {
218
218
fn visit_with < B > (
219
219
& self ,
220
- visitor : & mut dyn Visitor < I , BreakTy = B > ,
220
+ visitor : & mut dyn TypeVisitor < I , BreakTy = B > ,
221
221
outer_binder : DebruijnIndex ,
222
222
) -> ControlFlow < B > {
223
223
let interner = visitor. interner ( ) ;
@@ -229,7 +229,7 @@ impl<I: Interner> TypeVisitable<I> for ProgramClauses<I> {
229
229
impl < I : Interner > TypeVisitable < I > for Constraints < I > {
230
230
fn visit_with < B > (
231
231
& self ,
232
- visitor : & mut dyn Visitor < I , BreakTy = B > ,
232
+ visitor : & mut dyn TypeVisitor < I , BreakTy = B > ,
233
233
outer_binder : DebruijnIndex ,
234
234
) -> ControlFlow < B > {
235
235
let interner = visitor. interner ( ) ;
@@ -241,7 +241,7 @@ impl<I: Interner> TypeVisitable<I> for Constraints<I> {
241
241
impl < I : Interner > TypeVisitable < I > for QuantifiedWhereClauses < I > {
242
242
fn visit_with < B > (
243
243
& self ,
244
- visitor : & mut dyn Visitor < I , BreakTy = B > ,
244
+ visitor : & mut dyn TypeVisitor < I , BreakTy = B > ,
245
245
outer_binder : DebruijnIndex ,
246
246
) -> ControlFlow < B > {
247
247
let interner = visitor. interner ( ) ;
@@ -253,7 +253,7 @@ impl<I: Interner> TypeVisitable<I> for QuantifiedWhereClauses<I> {
253
253
impl < I : Interner > TypeVisitable < I > for PhantomData < I > {
254
254
fn visit_with < B > (
255
255
& self ,
256
- _visitor : & mut dyn Visitor < I , BreakTy = B > ,
256
+ _visitor : & mut dyn TypeVisitor < I , BreakTy = B > ,
257
257
_outer_binder : DebruijnIndex ,
258
258
) -> ControlFlow < B > {
259
259
ControlFlow :: Continue ( ( ) )
0 commit comments