advent-of-code-2022 VS advent-of-code

Rust 3a: use day_03::{intersect, priority}; fn main() { let input = include_bytes!("../../../input/day_03.txt"); let sum_of_priorities = input .split(|&byte| byte == b'\n') .map(|line| line.split_at(line.len() / 2)) // split into equally sized compartments .map(|(l, r)| intersect([l.iter().copied(), r.iter().copied()])) // find the intersection of the compartments .map(priority) // map to priorities .sum::(); println!("{}", sum_of_priorities); } 3b: use day_03::{intersect, priority}; fn main() { let input = include_bytes!("../../../input/day_03.txt"); let lines = input.split(|&byte| byte == b'\n').collect::>(); let sum_of_priorities = lines .chunks(3) .map(|chunks| intersect(chunks.iter().map(|chunk| chunk.iter().copied()))) .map(priority) // map to priorities .sum::(); println!("{}", sum_of_priorities); } shared code (module: `day_03`): use std::collections::HashSet; pub fn intersect(sets: I) -> u8 where I: IntoIterator, Set: IntoIterator, { let common = sets .into_iter() .map(|set| { let set: HashSet = HashSet::from_iter(set); set }) .reduce(|l, r| &l & &r); *common.unwrap().iter().next().unwrap() } pub fn priority(item: u8) -> u32 { (if item >= b'a' { item + 1 - b'a' } else { item + 27 - b'A' }) as u32 } repo: https://github.com/foresterre/advent-of-code-2022

github

- [Github](https://github.com/mdwhatcott/advent-of-code/blob/main/clj/src/aoc/y2021/d02.clj)

Clojure