---

yaml
---
r: 233592
b: refs/heads/beta
c: 63eedfc
h: refs/heads/master
v: v3

Author: nikomatsakis

[refs]

@@ -23,7 +23,7 @@ refs/tags/0.9: 36870b185fc5f5486636d4515f0e22677493f225
 refs/tags/0.10: ac33f2b15782272ae348dbd7b14b8257b2148b5a
 refs/tags/0.11.0: e1247cb1d0d681be034adb4b558b5a0c0d5720f9
 refs/tags/0.12.0: f0c419429ef30723ceaf6b42f9b5a2aeb5d2e2d1
-refs/heads/beta: 1630c7912f986f788b808160a004baea4180b64f
+refs/heads/beta: 63eedfcf536f02e09e7dca7290b803ad8aa243f9
 refs/tags/1.0.0-alpha: e42bd6d93a1d3433c486200587f8f9e12590a4d7
 refs/heads/tmp: 370fe2786109360f7c35b8ba552b83b773dd71d6
 refs/tags/1.0.0-alpha.2: 4c705f6bc559886632d3871b04f58aab093bfa2f

branches/beta/src/librustc_data_structures/transitive_relation.rs

@@ -93,10 +93,11 @@ impl<T:Debug+PartialEq> TransitiveRelation<T> {
         }
     }
 
-    /// Picks what I am referring to as the "best" upper-bound for `a`
-    /// and `b`. This is usually the least upper bound, but in cases where
-    /// there is no single least upper bound, it is the "mutual immediate postdominator",
-    /// if you imagine a graph where `a < b` means `a -> b`.
+    /// Picks what I am referring to as the "postdominating"
+    /// upper-bound for `a` and `b`. This is usually the least upper
+    /// bound, but in cases where there is no single least upper
+    /// bound, it is the "mutual immediate postdominator", if you
+    /// imagine a graph where `a < b` means `a -> b`.
     ///
     /// This function is needed because region inference currently
     /// requires that we produce a single "UB", and there is no best