Skip to content

Commit 8b52cdc

Browse files
committed
Update outdated comment
The highest-priority item is the *first* in the list, not the last. See [this code][1] for more. [this code]: https://github.com/rust-lang/rust/blob/0e63af5da3400ace48a0345117980473fd21ad73/compiler/rustc_mir_build/src/build/matches/mod.rs#L1334-L1335
1 parent 496836a commit 8b52cdc

File tree

1 file changed

+3
-3
lines changed
  • compiler/rustc_mir_build/src/build/matches

1 file changed

+3
-3
lines changed

compiler/rustc_mir_build/src/build/matches/mod.rs

+3-3
Original file line numberDiff line numberDiff line change
@@ -1226,9 +1226,9 @@ impl<'a, 'tcx> Builder<'a, 'tcx> {
12261226
/// this point, the input candidates have been fully simplified,
12271227
/// and so we know that all remaining match-pairs require some
12281228
/// sort of test. To decide what test to perform, we take the highest
1229-
/// priority candidate (last one in the list) and extract the
1230-
/// first match-pair from the list. From this we decide what kind
1231-
/// of test is needed using [`Builder::test`], defined in the
1229+
/// priority candidate (the first one in the list, as of January 2021)
1230+
/// and extract the first match-pair from the list. From this we decide
1231+
/// what kind of test is needed using [`Builder::test`], defined in the
12321232
/// [`test` module](mod@test).
12331233
///
12341234
/// *Note:* taking the first match pair is somewhat arbitrary, and

0 commit comments

Comments
 (0)