diff options
| author | Scott McMurray <scottmcm@users.noreply.github.com> | 2022-06-04 16:23:15 -0700 |
|---|---|---|
| committer | Scott McMurray <scottmcm@users.noreply.github.com> | 2022-09-19 23:24:34 -0700 |
| commit | 6dbd9a29c21db63e2c72f5e7f4f8b5ba58023875 (patch) | |
| tree | 983bdd8ac2914903d10871843668fa61cf28fdc3 /compiler/rustc_codegen_gcc/example/std_example.rs | |
| parent | c773c134c949661874d76313280e76cc3dd60975 (diff) | |
| download | rust-6dbd9a29c21db63e2c72f5e7f4f8b5ba58023875.tar.gz rust-6dbd9a29c21db63e2c72f5e7f4f8b5ba58023875.zip | |
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.
Diffstat (limited to 'compiler/rustc_codegen_gcc/example/std_example.rs')
0 files changed, 0 insertions, 0 deletions