mirror of
https://github.com/rust-lang/rust.git
synced 2026-05-22 10:05:06 +03:00
04a237b9e2
Consider this example: small_set = 0..2, large_set = 0..1000. To efficiently compute the union of these sets, we should * take all elements of the larger set * for each element of the smaller set check it is not in the larger set This is exactly what this commit does. This particular optimization was implemented a year ago, but the author mistaken `<` and `>`.