[][src]Struct ahash::AHasher

pub struct AHasher { /* fields omitted */ }

A Hasher for hashing an arbitrary stream of bytes.

Instances of AHasher represent state that is updated while hashing data.

Each method updates the internal state based on the new data provided. Once all of the data has been provided, the resulting hash can be obtained by calling finish()

Clone is also provided in case you wish to calculate hashes for two different items that start with the same data.


impl AHasher[src]

pub fn new_with_keys(key1: u128, key2: u128) -> Self[src]

Creates a new hasher keyed to the provided keys.

Normally hashers are created via AHasher::default() for fixed keys or RandomState::new() for randomly generated keys and RandomState::with_seeds(a,b) for seeds that are set and can be reused. All of these work at map creation time (and hence don't have any overhead on a per-item bais).

This method directly creates the hasher instance and performs no transformation on the provided seeds. This may be useful where a HashBuilder is not desired, such as for testing purposes.


use std::hash::Hasher;
use ahash::AHasher;

let mut hasher = AHasher::new_with_keys(1234, 5678);


println!("Hash is {:x}!", hasher.finish());

Trait Implementations

impl Clone for AHasher[src]

impl Debug for AHasher[src]

impl Default for AHasher[src]

Provides a default Hasher with fixed keys. This is typically used in conjunction with BuildHasherDefault to create AHashers in order to hash the keys of the map.

Generally it is preferable to use RandomState instead, so that different hashmaps will have different keys. However if fixed keys are desireable this may be used instead.


use std::hash::BuildHasherDefault;
use ahash::{AHasher, RandomState};
use std::collections::HashMap;

let mut map: HashMap<i32, i32, BuildHasherDefault<AHasher>> = HashMap::default();
map.insert(12, 34);

pub fn default() -> AHasher[src]

Constructs a new AHasher with fixed keys. If std is enabled these will be generated upon first invocation. Otherwise if the compile-time-rngfeature is enabled these will be generated at compile time. If neither of these features are available, hardcoded constants will be used.

Because the values are fixed, different hashers will all hash elements the same way. This could make hash values predictable, if DOS attacks are a concern. If this behaviour is not required, it may be preferable to use RandomState instead.


use ahash::AHasher;
use std::hash::Hasher;

let mut hasher_1 = AHasher::default();
let mut hasher_2 = AHasher::default();


assert_eq!(hasher_1.finish(), hasher_2.finish());

impl Hasher for AHasher[src]

Provides Hasher methods to hash all of the primitive types.

Auto Trait Implementations

impl RefUnwindSafe for AHasher

impl Send for AHasher

impl Sync for AHasher

impl Unpin for AHasher

impl UnwindSafe for AHasher

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized

impl<T> Borrow<T> for T where
    T: ?Sized

impl<T> BorrowMut<T> for T where
    T: ?Sized

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 

impl<T> ToOwned for T where
    T: Clone

type Owned = T

The resulting type after obtaining ownership.

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.