File tree 1 file changed +2
-2
lines changed
1 file changed +2
-2
lines changed Original file line number Diff line number Diff line change @@ -87,7 +87,7 @@ use self::Ordering::*;
87
87
/// *not* do `impl PartialEq<LocalType> for ForeignType`.
88
88
///
89
89
/// This avoids the problem of transitive chains that criss-cross crate boundaries: for all local
90
- /// types `T`, you may assue that no other crate will add `impl`s that allow comparing `T == U`. In
90
+ /// types `T`, you may assume that no other crate will add `impl`s that allow comparing `T == U`. In
91
91
/// other words, if other crates add `impl`s that allow building longer transitive chains `U1 == ...
92
92
/// == T == V1 == ...`, then all the types that appear to the right of `T` must be types that the
93
93
/// crate defining `T` already knows about. This rules out transitive chains where downstream crates
@@ -967,7 +967,7 @@ pub macro Ord($item:item) {
967
967
/// *not* do `impl PartialOrd<LocalType> for ForeignType`.
968
968
///
969
969
/// This avoids the problem of transitive chains that criss-cross crate boundaries: for all local
970
- /// types `T`, you may assue that no other crate will add `impl`s that allow comparing `T < U`. In
970
+ /// types `T`, you may assume that no other crate will add `impl`s that allow comparing `T < U`. In
971
971
/// other words, if other crates add `impl`s that allow building longer transitive chains `U1 < ...
972
972
/// < T < V1 < ...`, then all the types that appear to the right of `T` must be types that the crate
973
973
/// defining `T` already knows about. This rules out transitive chains where downstream crates can
You can’t perform that action at this time.
0 commit comments