File tree Expand file tree Collapse file tree 1 file changed +5
-4
lines changed
src/librustc_data_structures Expand file tree Collapse file tree 1 file changed +5
-4
lines changed Original file line number Diff line number Diff line change @@ -93,10 +93,11 @@ impl<T:Debug+PartialEq> TransitiveRelation<T> {
93
93
}
94
94
}
95
95
96
- /// Picks what I am referring to as the "best" upper-bound for `a`
97
- /// and `b`. This is usually the least upper bound, but in cases where
98
- /// there is no single least upper bound, it is the "mutual immediate postdominator",
99
- /// if you imagine a graph where `a < b` means `a -> b`.
96
+ /// Picks what I am referring to as the "postdominating"
97
+ /// upper-bound for `a` and `b`. This is usually the least upper
98
+ /// bound, but in cases where there is no single least upper
99
+ /// bound, it is the "mutual immediate postdominator", if you
100
+ /// imagine a graph where `a < b` means `a -> b`.
100
101
///
101
102
/// This function is needed because region inference currently
102
103
/// requires that we produce a single "UB", and there is no best
You can’t perform that action at this time.
0 commit comments