| commit | 14ad17adfad086cb4c355027b7f2d08cdfed7b8f | [log] [tgz] |
|---|---|---|
| author | Matthew Maurer <mmaurer@google.com> | Tue May 31 17:24:13 2022 +0000 |
| committer | Automerger Merge Worker <android-build-automerger-merge-worker@system.gserviceaccount.com> | Tue May 31 17:24:13 2022 +0000 |
| tree | 5420aebe7e6eefdf12bb6fd5ae3c36f0b707a3df | |
| parent | 2b2ef406bbd4c4e1564ad82bf9d7be9e023bebb6 [diff] | |
| parent | ff14c6f91a597ac5b60006d3189f71f8f6c77d38 [diff] |
Update TEST_MAPPING am: e9c5226f5a am: 3ffacaa5f3 am: ff14c6f91a Original change: https://android-review.googlesource.com/c/platform/external/rust/crates/rustc-hash/+/2108503 Change-Id: Ifd0c6b9a6f6c09776120f2f793e91a7dc79d13a6 Signed-off-by: Automerger Merge Worker <android-build-automerger-merge-worker@system.gserviceaccount.com>
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.