diff options
| -rw-r--r-- | src/librustc_mir/hair/pattern/_match.rs | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/librustc_mir/hair/pattern/_match.rs b/src/librustc_mir/hair/pattern/_match.rs index 8dace0bab7d..2e46cb9f8c9 100644 --- a/src/librustc_mir/hair/pattern/_match.rs +++ b/src/librustc_mir/hair/pattern/_match.rs @@ -1509,7 +1509,7 @@ pub fn is_useful<'p, 'a, 'tcx>( // 1) If the user is matching against a non-exhaustive // enum, there is no point in enumerating all possible // variants, because the user can't actually match - // against them himself, e.g., in an example like: + // against them themselves, e.g., in an example like: // ``` // let err: io::ErrorKind = ...; // match err { @@ -1885,9 +1885,9 @@ fn split_grouped_constructors<'p, 'tcx>( lint_overlapping_patterns(tcx, hir_id, ctor_range, ty, overlaps); - // We're going to iterate through every pair of borders, making sure that each - // represents an interval of nonnegative length, and convert each such interval - // into a constructor. + // We're going to iterate through every adjacent pair of borders, making sure that + // each represents an interval of nonnegative length, and convert each such + // interval into a constructor. for IntRange { range, .. } in borders.windows(2).filter_map(|window| match (window[0], window[1]) { (Border::JustBefore(n), Border::JustBefore(m)) => { |