@@ -334,9 +334,8 @@ pub macro PartialEq($item:item) {
334
334
#[ doc( alias = "!=" ) ]
335
335
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
336
336
#[ rustc_diagnostic_item = "Eq" ]
337
- #[ const_trait]
338
337
#[ rustc_const_unstable( feature = "const_cmp" , issue = "143800" ) ]
339
- pub trait Eq : [ const ] PartialEq < Self > + PointeeSized {
338
+ pub const trait Eq : [ const ] PartialEq < Self > + PointeeSized {
340
339
// this method is used solely by `impl Eq or #[derive(Eq)]` to assert that every component of a
341
340
// type implements `Eq` itself. The current deriving infrastructure means doing this assertion
342
341
// without using a method on this trait is nearly impossible.
@@ -966,9 +965,8 @@ impl<T: Clone> Clone for Reverse<T> {
966
965
#[ doc ( alias = ">=" ) ]
967
966
#[ stable ( feature = "rust1" , since = "1.0.0" ) ]
968
967
#[ rustc_diagnostic_item = "Ord "]
969
- #[ const_trait ]
970
968
#[ rustc_const_unstable ( feature = "const_cmp" , issue = "143800" ) ]
971
- pub trait Ord : [ const ] Eq + [ const ] PartialOrd < Self > + PointeeSized {
969
+ pub const trait Ord : [ const ] Eq + [ const ] PartialOrd < Self > + PointeeSized {
972
970
/// This method returns an [`Ordering`] between `self` and `other`.
973
971
///
974
972
/// By convention, `self.cmp(&other)` returns the ordering matching the expression
@@ -1352,9 +1350,8 @@ pub macro Ord($item:item) {
1352
1350
) ]
1353
1351
#[ rustc_diagnostic_item = "PartialOrd" ]
1354
1352
#[ allow ( multiple_supertrait_upcastable) ] // FIXME(sized_hierarchy): remove this
1355
- #[ const_trait]
1356
1353
#[ rustc_const_unstable ( feature = "const_cmp" , issue = "143800" ) ]
1357
- pub trait PartialOrd <Rhs : PointeeSized = Self >: PartialEq <Rhs > + PointeeSized {
1354
+ pub const trait PartialOrd <Rhs : PointeeSized = Self >: PartialEq <Rhs > + PointeeSized {
1358
1355
/// This method returns an ordering between `self` and `other` values if one exists.
1359
1356
///
1360
1357
/// # Examples
0 commit comments