| commit | 36dbea3621140b9e7ab26bd3cfbd59eff99df76b | [log] [tgz] |
|---|---|---|
| author | Xin Li <delphij@google.com> | Thu Aug 27 19:18:27 2020 +0000 |
| committer | Automerger Merge Worker <android-build-automerger-merge-worker@system.gserviceaccount.com> | Thu Aug 27 19:18:27 2020 +0000 |
| tree | 573af5f549361ed51070e0c4eaa2959687523995 | |
| parent | f0cb8a1342bde15d6cb0a54477638dd922a1622e [diff] | |
| parent | cdef229887d50e831ce076bbef1dbdf8cfe3955b [diff] |
[automerger skipped] Mark Android R (rvc-dev-plus-aosp-without-vendor@6692709) as merged am: 855ccbf7bb -s ours am: e7b4d7f7b0 -s ours am: cdef229887 -s ours am skip reason: Change-Id I5ad03c0357bdb217fe3fe24f786670e81962a756 with SHA-1 2aea95688b is in history Original change: https://googleplex-android-review.googlesource.com/c/platform/external/rust/crates/rustc-hash/+/12469938 Change-Id: I185db150c11d05269c7d81d753b5f591a9c8a29c
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.