A std::hash::Hasher which is designed to
work with already-hashed or hash-like data.
The provided hasher does minimal work under the assumption that the input data is already suitable
for use as a key in a HashSet or HashMap.
As well as the performance benefit, it also causes HashSets or HashMaps to become somewhat
deterministic. Given two equal HashSets or HashMaps containing more than a single element,
iterating them will yield the elements in differing orders. By using a
hash_hasher::HashedSet or
hash_hasher::HashedMap, then if
the same data is inserted and/or removed in the same order, iterating the collection will yield a
consistent order.
Since new() and with_capacity() aren't available for HashSets or HashMaps using custom
hashers, the available constructors are default(), with_hasher() and
with_capacity_and_hasher().
```rust extern crate hash_hasher;
use hash_hasher::{HashBuildHasher, HashedMap, HashedSet};
let mut map = HashedMap::default(); assert!(map.insert(0, "zero").is_none());
let mut set = HashedSet::withcapacityand_hasher(100, HashBuildHasher::default()); assert!(set.insert(0)); ```
A benchmark suite is included and sample figures can be found at the end of the nightly jobs of the AppVeyor results and the Travis results.
For example:
``` insertsha1sintosetusingdefaulthasher ... bench: 1,171 ns/iter (+/- 30) insertsha1sintosetusinghashhasher ... bench: 533 ns/iter (+/- 9)
insertsha256sintosetusingdefaulthasher ... bench: 1,340 ns/iter (+/- 57) insertsha256sintosetusinghashhasher ... bench: 546 ns/iter (+/- 11)
insertsha512sintosetusingdefaulthasher ... bench: 1,804 ns/iter (+/- 2,597) insertsha512sintosetusinghashhasher ... bench: 704 ns/iter (+/- 22)
insertsiphashesintosetusingdefaulthasher ... bench: 781 ns/iter (+/- 33) insertsiphashesintosetusinghashhasher ... bench: 256 ns/iter (+/- 50) ```
Licensed under either of
at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.