johannes/advent-of-rust-2024
1
0
Fork 0
Code Activity

clippy and cleanup

Browse Source
This commit is contained in:
Johannes
2024-12-12 18:47:22 +01:00
parent 6621a5a71a
commit dce8b1d2d5
2 changed files with 5 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/day11.rs
View File

@@ -23,7 +23,7 @@ fn solve(input: &str, blinks: i32) -> usize {
next.entry(1).and_modify(|count| *count += v).or_insert(v); next.entry(1).and_modify(|count| *count += v).or_insert(v);
} else if (k.ilog10() + 1) % 2 == 0 { } else if (k.ilog10() + 1) % 2 == 0 {
let l = (k.ilog10() + 1) / 2; let l = (k.ilog10() + 1) / 2;
let z: usize = 10usize.pow(l as u32); let z: usize = 10usize.pow(l);
let a = k / z; let a = k / z;
let b = k % z; let b = k % z;
next.entry(a).and_modify(|count| *count += v).or_insert(v); next.entry(a).and_modify(|count| *count += v).or_insert(v);

12
src/day12.rs
View File

@@ -91,8 +91,7 @@ fn sides(group: HashSet<(i64, i64)>) -> RiddleResult {
.filter(|p| !group.contains(&(p.0 - 1, p.1))) .filter(|p| !group.contains(&(p.0 - 1, p.1)))
.sorted_by_key(|p| p.1) .sorted_by_key(|p| p.1)
.collect_vec(); .collect_vec();
if points.is_empty() { if !points.is_empty() {
} else {
let count = points let count = points
.into_iter() .into_iter()
.tuple_windows() .tuple_windows()
@@ -106,8 +105,7 @@ fn sides(group: HashSet<(i64, i64)>) -> RiddleResult {
.filter(|p| !group.contains(&(p.0 + 1, p.1))) .filter(|p| !group.contains(&(p.0 + 1, p.1)))
.sorted_by_key(|p| p.1) .sorted_by_key(|p| p.1)
.collect_vec(); .collect_vec();
if points.is_empty() { if !points.is_empty() {
} else {
let count = points let count = points
.into_iter() .into_iter()
.tuple_windows() .tuple_windows()
@@ -123,8 +121,7 @@ fn sides(group: HashSet<(i64, i64)>) -> RiddleResult {
.filter(|p| !group.contains(&(p.0, p.1 - 1))) .filter(|p| !group.contains(&(p.0, p.1 - 1)))
.sorted_by_key(|p| p.0) .sorted_by_key(|p| p.0)
.collect_vec(); .collect_vec();
if points.is_empty() { if !points.is_empty() {
} else {
let count = points let count = points
.into_iter() .into_iter()
.tuple_windows() .tuple_windows()
@@ -138,8 +135,7 @@ fn sides(group: HashSet<(i64, i64)>) -> RiddleResult {
.filter(|p| !group.contains(&(p.0, p.1 + 1))) .filter(|p| !group.contains(&(p.0, p.1 + 1)))
.sorted_by_key(|p| p.0) .sorted_by_key(|p| p.0)
.collect_vec(); .collect_vec();
if points.is_empty() { if !points.is_empty() {
} else {
let count = points let count = points
.into_iter() .into_iter()
.tuple_windows() .tuple_windows()