Gabe/advent_of_code_2022
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

refactored day3 to reduce unneeded mem allocations.

Browse source 
ran rustfmt on all files.
This commit is contained in:
gabe 2022-12-03 02:26:42 -06:00
parent 6c35a97904
commit 05d08c134b
4 changed files with 15 additions and 32 deletions
Download patch file Download diff file Expand all files Collapse all files

8
src/day03/part1.rs
View file

@ -3,19 +3,15 @@ use crate::utilities::*;
pub fn part1(input: &[Rucksack]) -> usize {
input
.iter()
.map(|rucksack| {
let intersection: Vec<&char> = rucksack.0.intersection(&rucksack.1).collect();
assert!(intersection.len() == 1);
intersection[0]
})
.map(|rucksack| rucksack.0.intersection(&rucksack.1).next().unwrap())
.map(find_char_score)
.sum()
}
#[cfg(test)]
mod tests {
use std::collections::HashSet;
use super::*;
use std::collections::HashSet;
#[test]
fn test_part1() {

23
src/day03/part2.rs
View file

@ -13,31 +13,20 @@ pub fn part2(input: &[Rucksack]) -> usize {
.iter()
.filter(|c| group.1.contains(c))
.filter(|c| group.2.contains(c))
.map(|x| x.to_owned())
.next()
.unwrap()
}).map(|c| find_char_score(&c)).sum()
})
.map(find_char_score)
.sum()
}
fn seperate_groups(input: &[Rucksack]) -> Vec<Group> {
let mut output: Vec<Group> = Vec::new();
for group in input.chunks_exact(3) {
output.push(Group(
group[0]
.0
.union(&group[0].1)
.map(|x| x.to_owned())
.collect(),
group[1]
.0
.union(&group[1].1)
.map(|x| x.to_owned())
.collect(),
group[2]
.0
.union(&group[2].1)
.map(|x| x.to_owned())
.collect(),
group[0].0.union(&group[0].1).copied().collect(),
group[1].0.union(&group[1].1).copied().collect(),
group[2].0.union(&group[2].1).copied().collect(),
));
}
output