| commit | 56d4e9acc4002fbee19744e1b2ec8446cf2ddfeb | [log] [tgz] |
|---|---|---|
| author | Bob Badour <bbadour@google.com> | Tue Feb 16 21:22:37 2021 +0000 |
| committer | Automerger Merge Worker <android-build-automerger-merge-worker@system.gserviceaccount.com> | Tue Feb 16 21:22:37 2021 +0000 |
| tree | 16244a35292a0f1c14f6fbc0d6998e7e774c4ad7 | |
| parent | 37bd55757f13a0c6199a031c322d178a253e2e6b [diff] | |
| parent | 73ffca8559f6332ae6fc2ed1b0032b5b0de13ac1 [diff] |
[LSC] Add LOCAL_LICENSE_KINDS to external/rust/crates/rustc-hash am: 5f5d8f269f am: 73ffca8559 Original change: https://android-review.googlesource.com/c/platform/external/rust/crates/rustc-hash/+/1588717 MUST ONLY BE SUBMITTED BY AUTOMERGER Change-Id: I274b853ea94148ed3dfb5c453cb2495a0f126064
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.