rust - https://github.com/rust-lang/rust

Age	Commit message (Collapse)	Author	Lines
2024-01-11	Only lint ranges that really overlap	Nadrieril	-25/+19

2023-12-04	Remove the `precise_pointer_size_matching` feature gate	Nadrieril	-55/+24

2023-11-26	Auto merge of #117611 - Nadrieril:linear-pass-take-4, r=cjgillot	bors	-68/+79
	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
2023-11-24	Show number in error message even for one error	Nilstrieb	-1/+1
	Co-authored-by: Adrian <adrian.iosdev@gmail.com>
2023-11-22	Fully rework the algorithm and its explanation	Nadrieril	-27/+34

2023-11-22	Add some tests	Nadrieril	-41/+45

2023-10-27	Match usize/isize exhaustively	Nadrieril	-144/+84

2023-10-27	Add tests	Nadrieril	-14/+80

2023-10-27	Lint overlapping ranges as a separate pass	Nadrieril	-15/+58

2023-08-21	Add note when matching on tuples/ADTs containing non-exhaustive types	Sebastian Toh	-0/+4

2023-04-03	Perform match checking on THIR.	Camille GILLOT	-7/+7

2023-01-11	Move /src/test to /tests	Albert Larsan	-0/+953