commit | 631762c3e7927d73db52e376627c4209b4adff5d | [log] [tgz] |
---|---|---|
author | Treehugger Robot <treehugger-gerrit@google.com> | Wed Jun 15 22:28:50 2022 +0000 |
committer | Automerger Merge Worker <android-build-automerger-merge-worker@system.gserviceaccount.com> | Wed Jun 15 22:28:50 2022 +0000 |
tree | 647f331d69646771512fcdaf3b0f6bfb114240cf | |
parent | cb3bd24f8059f3977937c764ec52040f1a2d570d [diff] | |
parent | 15c89bb590201c17d77aa4ddfbadb9ce4579a9ce [diff] |
Merge "Update TEST_MAPPING" am: d09089c402 am: fda4ae1691 am: b9e389d827 am: 15c89bb590 Original change: https://android-review.googlesource.com/c/platform/external/rust/crates/rustc-hash/+/2123476 Change-Id: I3a21d0a501c77ada093aa614996ab5ceb70ac095 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_std
This 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.