Module advent_of_code_2023::day_2

This is my solution for Advent of Code - Day 2: Cube Conundrum

Games and Draws have structs to contain them. Most of the work is in parsing, which is quite heavily subdivided:

• parse_input
  • parse_game
    • parse_id
    • parse_draw
      • parse_cube

Once the input is in the internal representation it is mostly composing everything together:

• Part 1: sum_valid_game_ids uses is_valid_game for each line
• Part 2: sum_minimal_contents_powers splits the logic for each line between minimal_contents and draw_power

Structs

• Draw 🔒
  A record of the cubes shown in a single draw from a bag
• Game 🔒
  A record of draws made with a specific combination of cubes

Functions

• draw_power 🔒
  Given a draw, its “power” is the cube counts multiplied together
• is_valid_game 🔒
  Do any draws have more than the expected number of cubes
• minimal_contents 🔒
  Find the most cubes seen of each colour across the draws, giving the minimum number of each that must be in the bag
• parse_cube 🔒
  Parse e.g. 17 green as a numeric count and the colour string
• parse_draw 🔒
  Parse a comma separated list of drawn cubes as a Draw
• parse_game 🔒
  Parse a line of the puzzle input as a Game
• parse_id 🔒
  Parse Game {{ id }} as a numeric id
• parse_input 🔒
  Parse the puzzle input treating each line as a game specification
• run
  The entry point for running the solutions with the ‘real’ puzzle input.
• sum_minimal_contents_powers 🔒
  This is the solution to part 2 - delegates finding the minimal bag contents to minimal_contents and turning each bag into it’s power with draw_power
• sum_valid_game_ids 🔒
  This is the solution to part 1 - delegates validity to is_valid_game