create and use GlobalAlloc::address_space

[rust.git] / compiler / rustc_data_structures / src / transitive_relation.rs

diff --git a/compiler/rustc_data_structures/src/transitive_relation.rs b/compiler/rustc_data_structures/src/transitive_relation.rs
index 1ff0d58df140907129ac3d97d39a81ee10a3e630..cd391fe357a6f0b76f9975649bd6898fe547bf43 100644 (file)
--- a/compiler/rustc_data_structures/src/transitive_relation.rs
+++ b/compiler/rustc_data_structures/src/transitive_relation.rs
@@ -250,7 +250,7 @@ pub fn minimal_upper_bounds(&self, a: T, b: T) -> Vec<T> {
             // values. So here is what we do:
             //
             // 1. Find the vector `[X | a < X && b < X]` of all values
-            //    `X` where `a < X` and `b < X`.  In terms of the
+            //    `X` where `a < X` and `b < X`. In terms of the
             //    graph, this means all values reachable from both `a`
             //    and `b`. Note that this vector is also a set, but we
             //    use the term vector because the order matters