@@ -17,7 +17,7 @@ pub type SimplifiedType = SimplifiedTypeGen<DefId>;
17
17
/// because we sometimes need to use SimplifiedTypeGen values as stable sorting
18
18
/// keys (in which case we use a DefPathHash as id-type) but in the general case
19
19
/// the non-stable but fast to construct DefId-version is the better choice.
20
- #[ derive( Clone , Copy , Debug , PartialEq , Eq , Hash , PartialOrd , Ord , TyEncodable , TyDecodable ) ]
20
+ #[ derive( Clone , Copy , Debug , PartialEq , Eq , Hash , TyEncodable , TyDecodable ) ]
21
21
pub enum SimplifiedTypeGen < D >
22
22
where
23
23
D : Copy + Debug + Eq ,
@@ -124,7 +124,7 @@ pub fn simplify_type(
124
124
}
125
125
}
126
126
127
- impl < D : Copy + Debug + Ord + Eq > SimplifiedTypeGen < D > {
127
+ impl < D : Copy + Debug + Eq > SimplifiedTypeGen < D > {
128
128
pub fn def ( self ) -> Option < D > {
129
129
match self {
130
130
AdtSimplifiedType ( d)
@@ -140,7 +140,7 @@ impl<D: Copy + Debug + Ord + Eq> SimplifiedTypeGen<D> {
140
140
pub fn map_def < U , F > ( self , map : F ) -> SimplifiedTypeGen < U >
141
141
where
142
142
F : Fn ( D ) -> U ,
143
- U : Copy + Debug + Ord + Eq ,
143
+ U : Copy + Debug + Eq ,
144
144
{
145
145
match self {
146
146
BoolSimplifiedType => BoolSimplifiedType ,
@@ -171,7 +171,7 @@ impl<D: Copy + Debug + Ord + Eq> SimplifiedTypeGen<D> {
171
171
172
172
impl < ' a , D > HashStable < StableHashingContext < ' a > > for SimplifiedTypeGen < D >
173
173
where
174
- D : Copy + Debug + Ord + Eq + HashStable < StableHashingContext < ' a > > ,
174
+ D : Copy + Debug + Eq + HashStable < StableHashingContext < ' a > > ,
175
175
{
176
176
fn hash_stable ( & self , hcx : & mut StableHashingContext < ' a > , hasher : & mut StableHasher ) {
177
177
mem:: discriminant ( self ) . hash_stable ( hcx, hasher) ;
0 commit comments