| commit | d59daa5e5ecaa4f8e0dde144451a043318e8c1e2 | [log] [tgz] |
|---|---|---|
| author | Chih-Hung Hsieh <chh@google.com> | Thu Aug 27 23:47:16 2020 +0000 |
| committer | Automerger Merge Worker <android-build-automerger-merge-worker@system.gserviceaccount.com> | Thu Aug 27 23:47:16 2020 +0000 |
| tree | c189341cb00b5b8c87d3a82676b0ca039fed3d27 | |
| parent | 36dbea3621140b9e7ab26bd3cfbd59eff99df76b [diff] | |
| parent | a3327f384e61a74c47219d03a76133d66fb53dc9 [diff] |
Fix rustc-hash/METADATA am: c8c543e9e4 am: b470f6d616 am: 8a7fa51b5e am: a3327f384e Original change: https://android-review.googlesource.com/c/platform/external/rust/crates/rustc-hash/+/1414021 Change-Id: I4ba2099c8f601d782afe2c85e9f8a5c46edde184
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.