bert/adventofcode
1
0
Fork 0
mirror of https://github.com/bertptrs/adventofcode.git synced 2025-12-26 21:30:31 +01:00
Code Issues Projects Releases Wiki Activity

Bunch of clippy fixes

Browse Source
This commit is contained in:
Bert Peters
2023-01-28 22:52:46 +01:00
parent e914c17f81
commit d5d9b1c192
10 changed files with 23 additions and 30 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
2022/src/day19.rs
View File

@@ -105,17 +105,13 @@ impl BluePrint {
machines,
}) = todo.pop()
{
let ideal_from_now = ideal(time_left as u32);
let ideal_from_now = ideal(u32::from(time_left));
// Need to check again because we might've gotten a better result in the meantime.
if u32::from(best - got) >= ideal_from_now {
continue;
}
if todo.len() > 1_000_000 {
panic!(
"Safety: got a todo list of len {}, best: {best}",
todo.len()
);
}
assert!(todo.len() <= 1_000_000, "Safety: got a todo list of len {}, best: {best}",
todo.len());
for (element, &costs) in self.costs.iter().enumerate() {
let Some(min_to_build) = self.until_buildable(costs, resources, machines) else { break };
@@ -161,7 +157,7 @@ impl BluePrint {
let mut new_machines = machines;
new_machines[element] += 1;
let new_missed = ideal_from_now - ideal(time_after as u32);
let new_missed = ideal_from_now - ideal(u32::from(time_after));
todo.push(State {
missed: new_missed,
got,
@@ -249,7 +245,7 @@ pub fn part1(input: &[u8]) -> Result<String> {
Ok(blueprints
.into_iter()
.map(|bp| bp.max_geodes(24) as u32 * bp.id)
.map(|bp| u32::from(bp.max_geodes(24)) * bp.id)
.sum::<u32>()
.to_string())
}
@@ -260,7 +256,7 @@ pub fn part2(input: &[u8]) -> Result<String> {
let result: u32 = blueprints
.iter()
.take(3)
.map(|bp| bp.max_geodes(32) as u32)
.map(|bp| u32::from(bp.max_geodes(32)))
.product();
Ok(result.to_string())