simple cleanup

Author: majcn

src/bin/10.rs

@@ -28,8 +28,7 @@ fn part_x(grid: &Grid<u8>) -> FastMap<(Point, Point), u32> {
                 continue;
             }
 
-            for step in [LEFT, RIGHT, UP, DOWN] {
-                let next_location = location + step;
+            for next_location in ORTHOGONAL.map(|o| location + o) {
                 if grid.contains(next_location) && grid[next_location] == height + 1 {
                     paths.push((height + 1, next_location));
                 }

src/bin/16.rs

@@ -17,7 +17,7 @@ fn neighbors(
 ) -> Vec<(Point, Point, u32)> {
     let mut result = Vec::with_capacity(4);
 
-    for n_direction in [LEFT, RIGHT, UP, DOWN] {
+    for n_direction in ORTHOGONAL {
         let n_position = position + n_direction;
 
         if grid[n_position] != b'#' {
@@ -42,7 +42,7 @@ fn neighbors(
                 (DOWN, RIGHT) => 1001,
                 (DOWN, UP) => 2001,
 
-                _ => panic!("Invalid state"),
+                _ => unreachable!(),
             };
 
             result.push((n_position, n_direction, cost + n_cost_diff));

src/bin/17.rs

@@ -14,7 +14,7 @@ fn run_program(a: u64) -> Vec<u8> {
     let mut a = a;
     while a > 0 {
         let b = (a ^ 1) & 7;
-        result.push((((b ^ (a >> b)) ^ 4) & 7) as u8);
+        result.push((b ^ 4 ^ (a >> b) & 7) as u8);
 
         a >>= 3;
     }