diff options
| -rw-r--r-- | src/librustc_data_structures/transitive_relation.rs | 9 |
1 files changed, 5 insertions, 4 deletions
diff --git a/src/librustc_data_structures/transitive_relation.rs b/src/librustc_data_structures/transitive_relation.rs index 374c0a93a74..9d99f77deb9 100644 --- a/src/librustc_data_structures/transitive_relation.rs +++ b/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 |