rustfmt

d2/src/main.rs

@@ -15,7 +15,7 @@ impl RPS {
             'A' | 'X' => Rock,
             'B' | 'Y' => Paper,
             'C' | 'Z' => Scissor,
-            _ => panic!()
+            _ => panic!(),
         }
     }
     pub fn score(self) -> u32 {
@@ -48,7 +48,7 @@ impl Outcome {
             'X' => Loss,
             'Y' => Draw,
             'Z' => Win,
-            _ => panic!()
+            _ => panic!(),
         }
     }
 
@@ -56,7 +56,7 @@ impl Outcome {
         match self {
             Win => 6,
             Draw => 3,
-            Loss => 0
+            Loss => 0,
         }
     }
 
@@ -73,9 +73,15 @@ fn main() -> Result<(), Error> {
     let mut total_score_p1 = 0;
     let mut total_score_p2 = 0;
     for line in read_to_string("input.txt")?.split("\n") {
-        if line.is_empty() { continue }
+        if line.is_empty() {
+            continue;
+        }
         let (opponent, you) = (line.chars().nth(0).unwrap(), line.chars().nth(2).unwrap());
-        let (opponent, your_move, outcome) = (RPS::from_char(opponent), RPS::from_char(you), Outcome::from_char(you));
+        let (opponent, your_move, outcome) = (
+            RPS::from_char(opponent),
+            RPS::from_char(you),
+            Outcome::from_char(you),
+        );
         let score_p1 = your_move.score() + RPS::outcome(opponent, your_move).score();
         total_score_p1 += score_p1;
         let score_p2 = outcome.score() + outcome.for_opponent(opponent).score();

d3/src/main.rs

@@ -1,10 +1,10 @@
-use std::{io::Result, fs::read_to_string, collections::HashSet};
+use std::{collections::HashSet, fs::read_to_string, io::Result};
 
 pub fn priority(x: u8) -> u32 {
     (match x {
         0x61..=0x7a => x - 0x61 + 1,
         0x41..=0x5a => x - 0x41 + 27,
-        _ => unreachable!()
+        _ => unreachable!(),
     }) as u32
 }
 
@@ -16,19 +16,30 @@ fn main() -> Result<()> {
     let mut elves: Vec<HashSet<_>> = Vec::new();
 
     for line in read_to_string("input.txt")?.split("\n") {
-        if line.is_empty() { continue; }
+        if line.is_empty() {
+            continue;
+        }
         let bytes = line.as_bytes();
 
         let (first_half, second_half) = bytes.split_at(bytes.len() / 2);
         let in_first_half = first_half.iter().copied().collect::<HashSet<_>>();
         let in_second_half = second_half.iter().copied().collect::<HashSet<_>>();
-        let in_both_halves = in_first_half.intersection(&in_second_half).copied().next().unwrap();
+        let in_both_halves = in_first_half
+            .intersection(&in_second_half)
+            .copied()
+            .next()
+            .unwrap();
         p1_priority += priority(in_both_halves);
 
         let items = bytes.iter().copied().collect::<HashSet<_>>();
         elves.push(items.clone());
         if i == 2 {
-            let badge = items.iter().filter(|item| elves.iter().filter(|elf| elf.contains(item)).count() == 3).copied().next().unwrap();
+            let badge = items
+                .iter()
+                .filter(|item| elves.iter().filter(|elf| elf.contains(item)).count() == 3)
+                .copied()
+                .next()
+                .unwrap();
             p2_priority += priority(badge);
             elves.clear();
             i = 0;