| commit | 5996cda6175fd43b4e60a9f357a7f4c84514fdb2 | [log] [tgz] |
|---|---|---|
| author | James Farrell <jamesfarrell@google.com> | Wed Aug 28 22:55:15 2024 +0000 |
| committer | James Farrell <jamesfarrell@google.com> | Wed Aug 28 22:55:15 2024 +0000 |
| tree | 82305d08b799760d8d2df4297c7fc9acef65a700 | |
| parent | 960a1a42bf7df29988efed8d183e584bfd0497c2 [diff] |
Migrate 25 crates to monorepo. pin-project pin-project-internal pin-project-lite pkcs1 pkcs8 plotters-backend plotters-svg ppv-lite86 predicates-core predicates-tree prettyplease proc-macro2 rand rand_chacha rand_core rand_xorshift rayon rayon-core regex regex-syntax rusqlite rustc-demangle rustc-hash rustversion scopeguard Bug: 339424309 Test: treehugger Change-Id: I9dc77da8e761ec1390e616274138e684530a79cd
A speedy hash algorithm used within rustc. The hashmap in liballoc by default uses SipHash which isn‘t quite as speedy as we want. In the compiler we’re not really worried about DOS attempts, so we use a fast non-cryptographic hash.
This is the same as the algorithm used by Firefox -- which is a homespun one not based on any widely-known algorithm -- though modified to produce 64-bit hash values instead of 32-bit hash values. It consistently out-performs an FNV-based hash within rustc itself -- the collision rate is similar or slightly worse than FNV, but the speed of the hash function itself is much higher because it works on up to 8 bytes at a time.
use rustc_hash::FxHashMap; let mut map: FxHashMap<u32, u32> = FxHashMap::default(); map.insert(22, 44);
no_stdThis crate can be used as a no_std crate by disabling the std feature, which is on by default, as follows:
rustc-hash = { version = "1.0", default-features = false }
In this configuration, FxHasher is the only export, and the FxHashMap/FxHashSet type aliases are omitted.