@@ -9,8 +9,8 @@ extern crate self as chalk_ir;
99use crate :: cast:: { Cast , CastTo , Caster } ;
1010use crate :: fold:: shift:: Shift ;
1111use 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 } ;
1414use std:: marker:: PhantomData ;
1515use std:: ops:: ControlFlow ;
1616
@@ -1733,7 +1733,7 @@ where
17331733}
17341734
17351735/// 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 ) ]
17371737pub enum WhereClause < I : Interner > {
17381738 /// Type implements a trait.
17391739 Implemented ( TraitRef < I > ) ,
@@ -1831,7 +1831,7 @@ where
18311831/// A "domain goal" is a goal that is directly about Rust, rather than a pure
18321832/// logical statement. As much as possible, the Chalk solver should avoid
18331833/// 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 ) ]
18351835pub enum DomainGoal < I : Interner > {
18361836 /// Simple goal that is true if the where clause is true.
18371837 Holds ( WhereClause < I > ) ,
0 commit comments