aoc2023 0.1.0

Solutions to Advent of Code 2023
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68

use std::fmt::Display;

use crate::AoCDay;

#[derive(Debug, Clone)]
pub struct Data(Vec<u32>);

impl AoCDay<'_> for Data {
    fn try_new(input: &str) -> Option<Self> {
        Some(Self(
            input
                .lines()
                .filter_map(|line| line.parse().ok())
                .collect(),
        ))
    }

    fn part_1(&self) -> impl Display {
        self.0
            .iter()
            .map(|mass| mass / 3 - 2)
            .sum::<u32>()
    }

    fn part_2(&self) -> impl Display {
        fn needed_fuel(mass: u32) -> u32 {
            (mass / 3).saturating_sub(2)
        }

        // iteration
        let mut total = 0;
        for mass in &self.0 {
            let mut previous = needed_fuel(*mass);
            total += previous;
            loop {
                let needed = needed_fuel(previous);
                if needed > 0 {
                    total += needed;
                    previous = needed;
                } else {
                    break;
                }
            }
        }
        total
    }
}

#[cfg(test)]
mod test {
    use super::*;

    #[test]
    fn part_1() {
        let input = "";
        let data = Data::try_new(input).unwrap();
        let result = data.part_1().to_string();
        assert_eq!(result, "");
    }

    #[test]
    fn part_2() {
        let input = "";
        let data = Data::try_new(input).unwrap();
        let result = data.part_2().to_string();
        assert_eq!(result, "");
    }
}