File tree Expand file tree Collapse file tree 1 file changed +2
-2
lines changed Expand file tree Collapse file tree 1 file changed +2
-2
lines changed Original file line number Diff line number Diff line change @@ -87,7 +87,7 @@ use self::Ordering::*;
8787/// *not* do `impl PartialEq<LocalType> for ForeignType`.
8888///
8989/// 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
9191/// other words, if other crates add `impl`s that allow building longer transitive chains `U1 == ...
9292/// == T == V1 == ...`, then all the types that appear to the right of `T` must be types that the
9393/// crate defining `T` already knows about. This rules out transitive chains where downstream crates
@@ -967,7 +967,7 @@ pub macro Ord($item:item) {
967967/// *not* do `impl PartialOrd<LocalType> for ForeignType`.
968968///
969969/// 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
971971/// other words, if other crates add `impl`s that allow building longer transitive chains `U1 < ...
972972/// < T < V1 < ...`, then all the types that appear to the right of `T` must be types that the crate
973973/// 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