Fix inclusive range performance regression introduced by 1.90

Author: maneatingape

README.md

@@ -123,12 +123,12 @@ Performance is reasonable even on older hardware, for example a 2011 MacBook Pro
 | 14 | [Parabolic Reflector Dish](https://adventofcode.com/2023/day/14) | [Source](src/year2023/day14.rs) | 632 |
 | 15 | [Lens Library](https://adventofcode.com/2023/day/15) | [Source](src/year2023/day15.rs) | 84 |
 | 16 | [The Floor Will Be Lava](https://adventofcode.com/2023/day/16) | [Source](src/year2023/day16.rs) | 160 |
-| 17 | [Clumsy Crucible](https://adventofcode.com/2023/day/17) | [Source](src/year2023/day17.rs) | 2289 |
+| 17 | [Clumsy Crucible](https://adventofcode.com/2023/day/17) | [Source](src/year2023/day17.rs) | 2379 |
 | 18 | [Lavaduct Lagoon](https://adventofcode.com/2023/day/18) | [Source](src/year2023/day18.rs) | 17 |
 | 19 | [Aplenty](https://adventofcode.com/2023/day/19) | [Source](src/year2023/day19.rs) | 100 |
 | 20 | [Pulse Propagation](https://adventofcode.com/2023/day/20) | [Source](src/year2023/day20.rs) | 6 |
 | 21 | [Step Counter](https://adventofcode.com/2023/day/21) | [Source](src/year2023/day21.rs) | 182 |
-| 22 | [Sand Slabs](https://adventofcode.com/2023/day/22) | [Source](src/year2023/day22.rs) | 54 |
+| 22 | [Sand Slabs](https://adventofcode.com/2023/day/22) | [Source](src/year2023/day22.rs) | 40 |
 | 23 | [A Long Walk](https://adventofcode.com/2023/day/23) | [Source](src/year2023/day23.rs) | 68 |
 | 24 | [Never Tell Me The Odds](https://adventofcode.com/2023/day/24) | [Source](src/year2023/day24.rs) | 95 |
 | 25 | [Snowverload](https://adventofcode.com/2023/day/25) | [Source](src/year2023/day25.rs) | 179 |
@@ -175,7 +175,7 @@ Performance is reasonable even on older hardware, for example a 2011 MacBook Pro
 | 2 | [Dive!](https://adventofcode.com/2021/day/2) | [Source](src/year2021/day02.rs) | 12 |
 | 3 | [Binary Diagnostic](https://adventofcode.com/2021/day/3) | [Source](src/year2021/day03.rs) | 22 |
 | 4 | [Giant Squid](https://adventofcode.com/2021/day/4) | [Source](src/year2021/day04.rs) | 8 |
-| 5 | [Hydrothermal Venture](https://adventofcode.com/2021/day/5) | [Source](src/year2021/day05.rs) | 181 |
+| 5 | [Hydrothermal Venture](https://adventofcode.com/2021/day/5) | [Source](src/year2021/day05.rs) | 158 |
 | 6 | [Lanternfish](https://adventofcode.com/2021/day/6) | [Source](src/year2021/day06.rs) | 1 |
 | 7 | [The Treachery of Whales](https://adventofcode.com/2021/day/7) | [Source](src/year2021/day07.rs) | 8 |
 | 8 | [Seven Segment Search](https://adventofcode.com/2021/day/8) | [Source](src/year2021/day08.rs) | 14 |

src/year2015/day14.rs

@@ -27,11 +27,11 @@ pub fn part2_testable(input: &[Reindeer], time: u32) -> u32 {
     let mut scores = vec![0; input.len()];
     let mut distances = vec![0; input.len()];
 
-    for minute in 1..=time {
+    for minute in 0..time {
         let mut furthest = 0;
 
         for (index, &reindeer) in input.iter().enumerate() {
-            let next = distance(reindeer, minute);
+            let next = distance(reindeer, minute + 1);
             distances[index] = next;
             furthest = furthest.max(next);
         }

src/year2021/day05.rs

@@ -44,7 +44,7 @@ fn vents(input: Vec<[usize; 4]>, grid: &mut [u8]) -> usize {
         let delta = (y2 - y1).signum() * 1000 + (x2 - x1).signum();
         let mut index = y1 * 1000 + x1;
 
-        for _ in 0..=count {
+        for _ in 0..count + 1 {
             if grid[index as usize] == 1 {
                 result += 1;
             }

src/year2023/day04.rs

@@ -26,7 +26,7 @@ pub fn part2(input: &[usize]) -> u32 {
     let mut copies = vec![1; input.len()];
 
     for (i, &n) in input.iter().enumerate() {
-        (1..=n).for_each(|j| copies[i + j] += copies[i]);
+        (0..n).for_each(|j| copies[i + j + 1] += copies[i]);
     }
 
     copies.iter().sum()

src/year2023/day17.rs

@@ -102,7 +102,7 @@ fn astar<const L: i32, const U: i32>(grid: &Grid<i32>) -> i32 {
                 let mut next = index;
                 let mut extra = steps;
 
-                for i in 1..=U {
+                for i in 1..U + 1 {
                     if x + i >= size {
                         break;
                     }
@@ -120,7 +120,7 @@ fn astar<const L: i32, const U: i32>(grid: &Grid<i32>) -> i32 {
                 let mut next = index;
                 let mut extra = steps;
 
-                for i in 1..=U {
+                for i in 1..U + 1 {
                     if i > x {
                         break;
                     }
@@ -140,7 +140,7 @@ fn astar<const L: i32, const U: i32>(grid: &Grid<i32>) -> i32 {
                 let mut next = index;
                 let mut extra = steps;
 
-                for i in 1..=U {
+                for i in 1..U + 1 {
                     if y + i >= size {
                         break;
                     }
@@ -158,7 +158,7 @@ fn astar<const L: i32, const U: i32>(grid: &Grid<i32>) -> i32 {
                 let mut next = index;
                 let mut extra = steps;
 
-                for i in 1..=U {
+                for i in 1..U + 1 {
                     if i > y {
                         break;
                     }

src/year2023/day22.rs

@@ -95,11 +95,11 @@ pub fn parse(input: &str) -> Input {
 
         // Find the highest z coordinate underneath the brick looking downwards along the z axis
         // so only considering x and y coordinates.
-        for j in (start..=end).step_by(step) {
+        for j in (start..end + 1).step_by(step) {
             top = top.max(heights[j]);
         }
 
-        for j in (start..=end).step_by(step) {
+        for j in (start..end + 1).step_by(step) {
             if heights[j] == top {
                 let index = indices[j];
                 if index != previous {