Question: How is hashbrown faster than the stdlib HashMap? I’m curious as to how the hashbrown crate can have up to 2x performance on certain operations, even though it looks like the standard library’s HashMap is just a wrapper for hashbrown....