@@ -9,8 +9,8 @@ extern crate self as chalk_ir;
9
9
use crate :: cast:: { Cast , CastTo , Caster } ;
10
10
use crate :: fold:: shift:: Shift ;
11
11
use crate :: fold:: { Folder , Subst , TypeFoldable , TypeSuperFoldable } ;
12
- use crate :: visit:: { SuperVisit , TypeVisitable , VisitExt , Visitor } ;
13
- use chalk_derive:: { HasInterner , SuperVisit , TypeFoldable , TypeVisitable , Zip } ;
12
+ use crate :: visit:: { TypeSuperVisitable , TypeVisitable , VisitExt , Visitor } ;
13
+ use chalk_derive:: { HasInterner , TypeFoldable , TypeSuperVisitable , TypeVisitable , Zip } ;
14
14
use std:: marker:: PhantomData ;
15
15
use std:: ops:: ControlFlow ;
16
16
@@ -1733,7 +1733,7 @@ where
1733
1733
}
1734
1734
1735
1735
/// Where clauses that can be written by a Rust programmer.
1736
- #[ derive( Clone , PartialEq , Eq , Hash , TypeFoldable , SuperVisit , HasInterner , Zip ) ]
1736
+ #[ derive( Clone , PartialEq , Eq , Hash , TypeFoldable , TypeSuperVisitable , HasInterner , Zip ) ]
1737
1737
pub enum WhereClause < I : Interner > {
1738
1738
/// Type implements a trait.
1739
1739
Implemented ( TraitRef < I > ) ,
@@ -1831,7 +1831,7 @@ where
1831
1831
/// A "domain goal" is a goal that is directly about Rust, rather than a pure
1832
1832
/// logical statement. As much as possible, the Chalk solver should avoid
1833
1833
/// decomposing this enum, and instead treat its values opaquely.
1834
- #[ derive( Clone , PartialEq , Eq , Hash , TypeFoldable , SuperVisit , HasInterner , Zip ) ]
1834
+ #[ derive( Clone , PartialEq , Eq , Hash , TypeFoldable , TypeSuperVisitable , HasInterner , Zip ) ]
1835
1835
pub enum DomainGoal < I : Interner > {
1836
1836
/// Simple goal that is true if the where clause is true.
1837
1837
Holds ( WhereClause < I > ) ,
0 commit comments