Skip to content

Commit

Permalink
rustfmt the solutions
Browse files Browse the repository at this point in the history
  • Loading branch information
@frankhereford
frankhereford committed Dec 3, 2023
1 parent d2f6898 commit bcd3e8c
Show file tree
Hide file tree
Showing 3 changed files with 139 additions and 65 deletions.
69 changes: 51 additions & 18 deletions rust/src/solutions/day_01.rs
View file
Original file line number Diff line number Diff line change
@@ -1,26 +1,29 @@
//use web_sys::console;
use wasm_bindgen::prelude::*;
use regex::Regex;
use wasm_bindgen::prelude::*;

#[wasm_bindgen(module = "/src/solutions/workerHelpers.js")]
extern "C" {
fn postMessageToWorker(do_print: bool, message: &str);
}

pub fn solution_part_1() -> () {
postMessageToWorker(true, "Part 1: Concatenate the first and last digits found in a string.\n");
postMessageToWorker(
true,
"Part 1: Concatenate the first and last digits found in a string.\n",
);
let mut iteration = -1;
// let content = include_str!("input/day_01_part_1_test_input.txt");
let content = include_str!("input/day_01_input.txt");

let is_digit_regex = Regex::new(r"\d").unwrap();
let is_digit_regex = Regex::new(r"\d").unwrap();
let mut codes: Vec<u32> = Vec::new();

content.lines().for_each(|line| {
// Provide a mechanism to limit the volume of output on the console.
iteration += 1;
let mut show_message = false;
if (iteration) % 300 == 0 {
if (iteration) % 300 == 0 {
show_message = true;
}

Expand All @@ -31,7 +34,10 @@ pub fn solution_part_1() -> () {
}

postMessageToWorker(show_message, " ");
postMessageToWorker(show_message, &format!("Iteration: {}, input: {}", iteration, line));
postMessageToWorker(
show_message,
&format!("Iteration: {}, input: {}", iteration, line),
);

let mut first_digit: Option<&char> = None;
let mut last_digit: Option<&char> = None;
Expand All @@ -56,21 +62,23 @@ pub fn solution_part_1() -> () {
postMessageToWorker(true, &format!("⭐️ sum: {}", sum));
}


pub fn solution_part_2() -> () {
postMessageToWorker(true, "Part 2: Concatenate the first and last digits found in a string.\n");
postMessageToWorker(
true,
"Part 2: Concatenate the first and last digits found in a string.\n",
);
let mut iteration = -1;
// let content = include_str!("input/day_01_part_2_test_input.txt");
let content = include_str!("input/day_01_input.txt");

let is_digit_regex = Regex::new(r"\d").unwrap();
let is_digit_regex = Regex::new(r"\d").unwrap();
let mut codes: Vec<u32> = Vec::new();

content.lines().for_each(|line| {
// Provide a mechanism to limit the volume of output on the console.
iteration += 1;
let mut show_message = false;
if (iteration) % 300 == 0 {
if (iteration) % 300 == 0 {
show_message = true;
}

Expand All @@ -81,44 +89,65 @@ pub fn solution_part_2() -> () {
}

postMessageToWorker(show_message, " ");
postMessageToWorker(show_message, &format!("Iteration: {}, input: {}", iteration, line));
postMessageToWorker(
show_message,
&format!("Iteration: {}, input: {}", iteration, line),
);

let mut first_digit: Option<char> = None;
let mut last_digit: Option<char> = None;

let numbers = ["one", "two", "three", "four", "five", "six", "seven", "eight", "nine"];
let numbers = [
"one", "two", "three", "four", "five", "six", "seven", "eight", "nine",
];

for (character_index, character) in characters.iter().enumerate() {
if is_digit_regex.is_match(character.to_string().as_str()) {
if first_digit == None {
let temp_string = character.to_string();
let char = temp_string.chars().nth(0).unwrap();
first_digit = Some(char);
postMessageToWorker(show_message, &format!("New first digit from numeric character: {}", character));
postMessageToWorker(
show_message,
&format!("New first digit from numeric character: {}", character),
);
}
let temp_string = character.to_string();
let char = temp_string.chars().nth(0).unwrap();
last_digit = Some(char);
postMessageToWorker(show_message, &format!("New last digit from numeric character: {}", character));
postMessageToWorker(
show_message,
&format!("New last digit from numeric character: {}", character),
);
}
for (number_index, number) in numbers.iter().enumerate() {
let length = number.len();
let slice = get_string_slice(line, character_index, length);
// postMessageToWorker(show_message, &format!("number: {}, slice: {}", number, slice));
if &slice == number {
let found_scalar = number_index + 1;

if first_digit.is_none() {
let temp_string = found_scalar.to_string();
let char = temp_string.chars().nth(0).unwrap();
first_digit = Some(char);
postMessageToWorker(show_message, &format!("Found first digit: {}", first_digit.unwrap()));
postMessageToWorker(
show_message,
&format!("Found first digit: {}", first_digit.unwrap()),
);
}

let temp_string = found_scalar.to_string();
let char = temp_string.chars().nth(0).unwrap();
last_digit = Some(char);
postMessageToWorker(show_message, &format!("New last digit from number ({}): {}", number, last_digit.unwrap()));
postMessageToWorker(
show_message,
&format!(
"New last digit from number ({}): {}",
number,
last_digit.unwrap()
),
);
}
}
}
Expand All @@ -134,10 +163,14 @@ pub fn solution_part_2() -> () {

fn get_string_slice(input: &str, start: usize, chars: usize) -> &str {
let start_index = input.char_indices().nth(start);
let end_index = input.char_indices().nth(start + chars).unwrap_or((input.len(), ' ')).0;
let end_index = input
.char_indices()
.nth(start + chars)
.unwrap_or((input.len(), ' '))
.0;

match start_index {
Some((start_idx, _)) => &input[start_idx..end_index],
None => ""
None => "",
}
}
90 changes: 57 additions & 33 deletions rust/src/solutions/day_02.rs
View file
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
//use web_sys::console;
#![allow(unreachable_code)]
use wasm_bindgen::prelude::*;
use regex::Regex;
use std::collections::HashMap;
use wasm_bindgen::prelude::*;

#[wasm_bindgen(module = "/src/solutions/workerHelpers.js")]
extern "C" {
Expand All @@ -24,7 +24,7 @@ pub fn solution_part_1() -> () {
// Provide a mechanism to limit the volume of output on the console.
iteration += 1;
let mut show_message = false;
if (iteration) % 30 == 0 {
if (iteration) % 30 == 0 {
show_message = true;
}

Expand All @@ -35,19 +35,21 @@ pub fn solution_part_1() -> () {
}

postMessageToWorker(show_message, " ");
postMessageToWorker(show_message, &format!("Iteration: {}, input: {}", iteration, line));
postMessageToWorker(
show_message,
&format!("Iteration: {}, input: {}", iteration, line),
);

let mut proposed_setup = HashMap::new();
proposed_setup.insert("red", 12);
proposed_setup.insert("green", 13);
proposed_setup.insert("blue", 14);


if let Some(caps) = input_chunks.captures(line) {
postMessageToWorker(show_message, &format!(""));
let game = caps.get(1).map_or("", |m| m.as_str());
let game_int = game.parse::<u32>().expect("Should be able to parse game");

let mut demonstration_knowledge = HashMap::new();

// postMessageToWorker(show_message, &format!("game: {}", game));
Expand All @@ -64,35 +66,48 @@ pub fn solution_part_1() -> () {

// added .expect()s with copilot here
if demonstration_knowledge.contains_key(color) {
let current_count = *demonstration_knowledge.get(color).expect("Value must exist since key exists");
let parsed_count = count.parse::<u32>().expect("Should be able to parse count");
let current_count = *demonstration_knowledge
.get(color)
.expect("Value must exist since key exists");
let parsed_count =
count.parse::<u32>().expect("Should be able to parse count");
if parsed_count > current_count {
demonstration_knowledge.insert(color, parsed_count);
}
} else {
demonstration_knowledge.insert(color, count.parse::<u32>().expect("Should be able to parse count"));
demonstration_knowledge.insert(
color,
count.parse::<u32>().expect("Should be able to parse count"),
);
}

}
}
}
postMessageToWorker(show_message, &format!("demonstration_knowledge: {:?}", demonstration_knowledge));
let is_possible = is_possible_game(&proposed_setup, &demonstration_knowledge);
if is_possible {
possible_games.push(game_int)
}
postMessageToWorker(show_message, &format!("is possible: {:?}", is_possible));
postMessageToWorker(
show_message,
&format!("demonstration_knowledge: {:?}", demonstration_knowledge),
);
let is_possible = is_possible_game(&proposed_setup, &demonstration_knowledge);
if is_possible {
possible_games.push(game_int)
}
postMessageToWorker(show_message, &format!("is possible: {:?}", is_possible));
}
});
let sum: u32 = possible_games.iter().sum();
postMessageToWorker(true, &format!("⭐️ sum: {}", sum));
}

fn is_possible_game(proposed_setup: &HashMap<&str, u32>, demonstration_knowledge: &HashMap<&str, u32>) -> bool {
fn is_possible_game(
proposed_setup: &HashMap<&str, u32>,
demonstration_knowledge: &HashMap<&str, u32>,
) -> bool {
let mut is_possible = true;
for (color, count) in proposed_setup {
if demonstration_knowledge.contains_key(color) {
let demonstration_count = *demonstration_knowledge.get(color).expect("Value must exist since key exists");
let demonstration_count = *demonstration_knowledge
.get(color)
.expect("Value must exist since key exists");
if demonstration_count > *count {
is_possible = false;
}
Expand All @@ -103,8 +118,6 @@ fn is_possible_game(proposed_setup: &HashMap<&str, u32>, demonstration_knowledge
is_possible
}



pub fn solution_part_2() -> () {
postMessageToWorker(true, "Part 2: Minimize valid case.\n");
let mut iteration = -1;
Expand All @@ -120,7 +133,7 @@ pub fn solution_part_2() -> () {
// Provide a mechanism to limit the volume of output on the console.
iteration += 1;
let mut show_message = false;
if (iteration) % 30 == 0 {
if (iteration) % 30 == 0 {
show_message = true;
}

Expand All @@ -131,11 +144,14 @@ pub fn solution_part_2() -> () {
}

postMessageToWorker(show_message, " ");
postMessageToWorker(show_message, &format!("Iteration: {}, input: {}", iteration, line));
postMessageToWorker(
show_message,
&format!("Iteration: {}, input: {}", iteration, line),
);

if let Some(caps) = input_chunks.captures(line) {
postMessageToWorker(show_message, &format!(""));

let mut demonstration_knowledge = HashMap::new();

// postMessageToWorker(show_message, &format!("game: {}", game));
Expand All @@ -152,28 +168,36 @@ pub fn solution_part_2() -> () {

// added .expect()s with copilot here
if demonstration_knowledge.contains_key(color) {
let current_count = *demonstration_knowledge.get(color).expect("Value must exist since key exists");
let parsed_count = count.parse::<u32>().expect("Should be able to parse count");
let current_count = *demonstration_knowledge
.get(color)
.expect("Value must exist since key exists");
let parsed_count =
count.parse::<u32>().expect("Should be able to parse count");
if parsed_count > current_count {
demonstration_knowledge.insert(color, parsed_count);
}
} else {
demonstration_knowledge.insert(color, count.parse::<u32>().expect("Should be able to parse count"));
demonstration_knowledge.insert(
color,
count.parse::<u32>().expect("Should be able to parse count"),
);
}

}
}
}
postMessageToWorker(show_message, &format!("demonstration_knowledge: {:?}", demonstration_knowledge));
let mut game_power = 1;
for (_color, count) in demonstration_knowledge {
game_power = game_power * count;
postMessageToWorker(
show_message,
&format!("demonstration_knowledge: {:?}", demonstration_knowledge),
);
let mut game_power = 1;
for (_color, count) in demonstration_knowledge {
game_power = game_power * count;
}
game_powers.push(game_power);
postMessageToWorker(show_message, &format!("game_power: {:?}", game_power));
game_powers.push(game_power);
postMessageToWorker(show_message, &format!("game_power: {:?}", game_power));
}
});

let sum: u32 = game_powers.iter().sum();
postMessageToWorker(true, &format!("⭐️ sum: {}", sum));
}
}
Loading

0 comments on commit bcd3e8c

Please sign in to comment.