diff options
| author | bors <bors@rust-lang.org> | 2022-09-21 00:41:33 +0000 | 
|---|---|---|
| committer | bors <bors@rust-lang.org> | 2022-09-21 00:41:33 +0000 | 
| commit | 4ecfdfac51b159f68fce608792affb34a70e6f73 (patch) | |
| tree | 865094472832265f18c603b4c58f6484ce3e69a7 /compiler/rustc_trait_selection/src/traits/select/confirmation.rs | |
| parent | 7743aa836ee16d04831a34ee1ff109bf9d411277 (diff) | |
| parent | 6dbd9a29c21db63e2c72f5e7f4f8b5ba58023875 (diff) | |
| download | rust-4ecfdfac51b159f68fce608792affb34a70e6f73.tar.gz rust-4ecfdfac51b159f68fce608792affb34a70e6f73.zip | |
Auto merge of #100214 - scottmcm:strict-range, r=thomcc
Optimize `array::IntoIter` `.into_iter()` on arrays was slower than it needed to be (especially compared to slice iterator) since it uses `Range<usize>`, which needs to handle degenerate ranges like `10..4`. This PR adds an internal `IndexRange` type that's like `Range<usize>` but with a safety invariant that means it doesn't need to worry about those cases -- it only handles `start <= end` -- and thus can give LLVM more information to optimize better. I added one simple demonstration of the improvement as a codegen test. (`vec::IntoIter` uses pointers instead of indexes, so doesn't have this problem, but that only works because its elements are boxed. `array::IntoIter` can't use pointers because that would keep it from being movable.)
Diffstat (limited to 'compiler/rustc_trait_selection/src/traits/select/confirmation.rs')
0 files changed, 0 insertions, 0 deletions
