Struct fhash::RandomState

pub struct RandomState { /* private fields */ }

State used for the random hashing algorithm in HashMap and HashSet. RandomState introduces randomness into the hashing process to mitigate certain types of hash collision attacks, enhancing the security and resilience of the data structures. It is designed to make it harder for attackers to predict hash values and exploit vulnerabilities in the hash function.

Example

use hashbrown::HashMap;
use fhash::RandomState;

// Create a HashMap using RandomState as the hasher
let mut map: HashMap<i32, &str, RandomState> = HashMap::default();

// Inserting values into the HashMap
map.insert(1, "apple");
map.insert(2, "banana");

// Retrieve values from the HashMap
assert_eq!(map.get(&1), Some(&"apple"));
assert_eq!(map.get(&2), Some(&"banana"));

Trait Implementations

impl BuildHasher for RandomState

fn build_hasher(&self) -> FHasher

Builds a new FHasher using the current RandomState’s state.

type Hasher = FHasher

Type of the hasher that will be created.

fn hash_one<T>(&self, x: T) -> u64

where T: Hash, Self: Sized, Self::Hasher: Hasher,

Calculates the hash of a single value.

impl Default for RandomState

fn default() -> Self

Creates a new RandomState with state seeded from current time.

impl From<u64> for RandomState

fn from(state: u64) -> Self

Use custom u64 value as a seed for RandomState. Useful in no_std scenarios or environments with limited standard library access where direct construction from a u64 value is beneficial.