Initial commit

Author: simonmichal

Diff for: .gitignore

@@ -0,0 +1,3 @@
+/target
+.idea
+Cargo.lock

Diff for: Cargo.toml

@@ -0,0 +1,13 @@
+[package]
+name = "adv-code-2024"
+version = "0.1.0"
+edition = "2021"
+
+[dependencies]
+anyhow = "1.0.93"
+code-timing-macros = { version = "0.0.5", features = ["release"] }
+const_format = "0.2.33"
+
+# Additional recommended dependencies
+itertools = "0.13.0"
+regex = "1.11.1"

Diff for: README.md

@@ -0,0 +1,23 @@
+# Template for solving Advent of Code puzzles in Rust with RustRover
+
+Read the [blog post](https://blog.jetbrains.com/rust/2024/11/29/advent-of-code-in-rust-for-the-rest-of-us/) that explains the structure and rationale behind this template.
+
+## Usage
+
+1. Create a new project from the template repository:
+   - Using GitHub’s templating feature: Simply click the Use this template [button](https://github.com/new?template_name=advent-of-code-rust-template&template_owner=bravit) on the repository page, create a new repository, and then open it in [RustRover](https://www.jetbrains.com/rust/) by selecting *File | New | Project From Version Control…*.
+   -  Adding the template to RustRover: You can integrate the template directly into RustRover and use the regular New Project wizard.
+
+2. Whenever you're ready to start solving a new day's puzzle:
+   - Open the `bin` folder, copy and paste the `NN.rs` file into it, and give it the corresponding name (`01.rs`, `02.rs`, etc.).
+   - In the `input` folder, create and fill the input data file (`01.txt`, `02.txt`, etc.).
+   - Fill in the `DAY` constant in the freshly created file.
+   - Run the current day's solution to check if it compiles (you can use the gutter icon next to the `main` function).
+   - Fill in `<TEST-INPUT>`.
+   - Write the expected answer for the test data in the `assert_eq` statement in *Part 1*.
+   - Now you're ready to write your solution in the `part1` function (inside `main`).
+   - Use `Shift+F10` (Win/Linux) or `Ctrl-R` (macOS) to re-run the same program.
+
+3. When you're done with the first part of the puzzle, use folding to hide *Part 1*.
+
+4. Uncomment *Part 2*, fill in the test data assertion, and start solving it.

Diff for: input/.keep

@@ -0,0 +1,50 @@
+use anyhow::*;
+use std::fs::File;
+use std::io::{BufRead, BufReader};
+use code_timing_macros::time_snippet;
+use const_format::concatcp;
+use adv_code_2024::*;
+
+const DAY: &str = "NN"; // TODO: Fill the day
+const INPUT_FILE: &str = concatcp!("input/", DAY, ".txt");
+
+const TEST: &str = "\
+<TEST-INPUT>
+"; // TODO: Add the test input
+
+fn main() -> Result<()> {
+    start_day(DAY);
+
+    //region Part 1
+    println!("=== Part 1 ===");
+
+    fn part1<R: BufRead>(reader: R) -> Result<usize> {
+        // TODO: Solve Part 1 of the puzzle
+        let answer = reader.lines().flatten().count();
+        Ok(answer)
+    }
+
+    // TODO: Set the expected answer for the test input
+    assert_eq!(0, part1(BufReader::new(TEST.as_bytes()))?);
+
+    let input_file = BufReader::new(File::open(INPUT_FILE)?);
+    let result = time_snippet!(part1(input_file)?);
+    println!("Result = {}", result);
+    //endregion
+
+    //region Part 2
+    // println!("\n=== Part 2 ===");
+    //
+    // fn part2<R: BufRead>(reader: R) -> Result<usize> {
+    //     Ok(0)
+    // }
+    //
+    // assert_eq!(0, part2(BufReader::new(TEST.as_bytes()))?);
+    //
+    // let input_file = BufReader::new(File::open(INPUT_FILE)?);
+    // let result = time_snippet!(part2(input_file)?);
+    // println!("Result = {}", result);
+    //endregion
+
+    Ok(())
+}

Diff for: src/bin/NN.rs

@@ -0,0 +1,15 @@
+pub fn start_day(day: &str) {
+    println!("Advent of Code 2024 - Day {:0>2}", day);
+}
+
+// Additional common functions
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn it_works() {
+        start_day("00");
+    }
+}