rust/tests/ui/pattern/usefulness/integer-ranges, branch 1.78.0

Remove `MaybeInfiniteInt::JustAfterMax`

2024-03-13T13:17:11+00:00

It was inherited from before half-open ranges, but it doesn't pull its weight anymore. We lose a tiny bit of diagnostic precision.

Rollup merge of #121908 - Nadrieril:dynamic-variant-collection, r=matthewjasper

2024-03-13T05:41:21+00:00

match lowering: don't collect test alternatives ahead of time I'm very happy with this one. Before this, when sorting candidates into the possible test branches, we manually computed `usize` indices to determine in which branch each candidate goes. To make this work we had a first pass that collected the possible alternatives we'd have to deal with, and a second pass that actually sorts the candidates. In this PR, I replace `usize` indices with a dedicated enum. This makes `sort_candidates` easier to follow, and we don't need the first pass anymore. r? ``@matthewjasper``

Lint small gaps between ranges

2024-03-09T00:14:22+00:00

Allow lint where we don't care

2024-03-09T00:13:42+00:00

Fix a subtle regression

2024-03-02T17:38:37+00:00

Before, the SwitchInt cases were computed in two passes: if the first pass accepted e.g. 0..=5 and then 1, the second pass would not accept 0..=5 anymore because 1 would be listed in the SwitchInt options. Now there's a single pass, so if we sort 0..=5 we must take care to not sort a subsequent 1.

[AUTO-GENERATED] Migrate ui tests from `//` to `//@` directives

2024-02-16T20:02:50+00:00

Only lint ranges that really overlap

2024-01-11T13:04:11+00:00

Remove the `precise_pointer_size_matching` feature gate

2023-12-04T10:56:21+00:00

Auto merge of #117611 - Nadrieril:linear-pass-take-4, r=cjgillot

2023-11-26T00:14:14+00:00

Rewrite exhaustiveness in one pass This is at least my 4th attempt at this in as many years x) Previous attempts were all too complicated or too slow. But we're finally here! The previous version of the exhaustiveness algorithm computed reachability for each arm then exhaustiveness of the whole match. Since each of these steps does roughly the same things, this rewrites the algorithm to do them all in one go. I also think this makes things much simpler. I also rewrote the documentation of the algorithm in depth. Hopefully it's up-to-date and easier to follow now. Plz comment if anything's unclear. r? `@oli-obk` I think you're one of the rare other people to understand the exhaustiveness algorithm? cc `@varkor` I know you're not active anymore, but if you feel like having a look you might enjoy this :D Fixes https://github.com/rust-lang/rust/issues/79307

Show number in error message even for one error

2023-11-24T18:15:52+00:00

Co-authored-by: Adrian