traxys/aoc_2025
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Use FX Hash

Browse source
This commit is contained in:
Quentin Boyer 2025-12-10 01:39:56 +01:00
parent 172b33b63c
commit c9bd84ebdb
3 changed files with 19 additions and 14 deletions
Download patch file Download diff file Expand all files Collapse all files

7
Cargo.lock generated
View file

@ -76,6 +76,7 @@ dependencies = [
"clap",
"color-eyre",
"humantime",
"rustc-hash",
]
[[package]]
@ -319,6 +320,12 @@ version = "0.1.26"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "56f7d92ca342cea22a06f2121d944b4fd82af56988c270852495420f961d4ace"
[[package]]
name = "rustc-hash"
version = "2.1.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "357703d41365b4b27c590e3ed91eabb1b663f07c4c084095e60cbed4362dff0d"
[[package]]
name = "serde"
version = "1.0.228"

1
Cargo.toml
View file

@ -10,6 +10,7 @@ bstr = "1.11.0"
clap = { version = "4.5.21", features = ["derive"] }
color-eyre = "0.6.3"
humantime = "2.1.0"
rustc-hash = "2.1.1"
[profile.release]
debug = true

25
src/bin/day9.rs
View file

@ -1,9 +1,6 @@
use std::{
collections::{HashMap, HashSet},
hash::Hash,
ops::RangeInclusive,
time::Instant,
};
use std::{collections::HashSet, hash::Hash, ops::RangeInclusive, time::Instant};
use rustc_hash::FxHashMap;
use aoc_2025::{load, print_res};
use bstr::BString;
@ -184,7 +181,7 @@ impl Polygon {
}
}
struct InsertGuard<'a, K, V>(K, V, &'a mut HashMap<K, V>)
struct InsertGuard<'a, K, V>(K, V, &'a mut FxHashMap<K, V>)
where
K: Hash + Eq + Copy,
V: Copy;
@ -203,8 +200,8 @@ fn horizontal_edges_contained(
poly: &Polygon,
a: Point2,
b: Point2,
cache: &mut HashMap<Point2, bool>,
edge_cache: &mut HashMap<(u32, (u32, u32)), bool>,
cache: &mut FxHashMap<Point2, bool>,
edge_cache: &mut FxHashMap<(u32, (u32, u32)), bool>,
) -> bool {
assert_ne!(a.x, b.x);
@ -277,8 +274,8 @@ fn vertical_edges_contain(
poly: &Polygon,
a: Point2,
b: Point2,
cache: &mut HashMap<Point2, bool>,
edge_cache: &mut HashMap<(u32, (u32, u32)), bool>,
cache: &mut FxHashMap<Point2, bool>,
edge_cache: &mut FxHashMap<(u32, (u32, u32)), bool>,
) -> bool {
assert_ne!(a.y, b.y);
@ -353,9 +350,9 @@ pub fn part2(input: Parsed) {
let mut max_area = 0;
let mut contains_cache = HashMap::new();
let mut h_edge_cache = HashMap::new();
let mut v_edge_cache = HashMap::new();
let mut contains_cache = FxHashMap::default();
let mut h_edge_cache = FxHashMap::default();
let mut v_edge_cache = FxHashMap::default();
for (ia, &a) in poly.points().iter().enumerate() {
for &b in poly.points().iter().skip(ia + 1) {