---

yaml
---
r: 232593
b: refs/heads/try
c: 63eedfc
h: refs/heads/master
i:
  232591: a8117c4
v: v3

Author: nikomatsakis

[refs]

@@ -1,7 +1,7 @@
 ---
 refs/heads/master: edeb4f1c86cbf6af8ef9874d4b3af50f721ea1b8
 refs/heads/snap-stage3: 1af31d4974e33027a68126fa5a5a3c2c6491824f
-refs/heads/try: 1630c7912f986f788b808160a004baea4180b64f
+refs/heads/try: 63eedfcf536f02e09e7dca7290b803ad8aa243f9
 refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
 refs/tags/release-0.2: c870d2dffb391e14efb05aa27898f1f6333a9596
 refs/tags/release-0.3: b5f0d0f648d9a6153664837026ba1be43d3e2503

branches/try/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