Struct RapidRandomState

pub struct RapidRandomState { /* private fields */ }

A std::collections::hash_map::RandomState compatible hasher that initializes the RapidHasher algorithm with a random seed.

Note this is not sufficient to prevent HashDoS attacks. The rapidhash algorithm is not proven to be resistant, and the seed used is not wide enough.

Example

use std::collections::HashMap;
use std::hash::Hasher;
use rapidhash::RapidRandomState;

let mut map = HashMap::with_hasher(RapidRandomState::default());
map.insert(42, "the answer");

Implementations

impl RapidRandomState

pub fn new() -> Self

Create a new random state with a random seed.

With the rand feature enabled, this will use [rand::random] to initialise the seed.

Without rand but with the std feature enabled, this will use crate::rapidrng_time to initialise the seed.

Trait Implementations

impl BuildHasher for RapidRandomState

type Hasher = RapidHasher

Type of the hasher that will be created.

fn build_hasher(&self) -> Self::Hasher

Creates a new hasher.

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

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

Calculates the hash of a single value.

impl Clone for RapidRandomState

fn clone(&self) -> RapidRandomState

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Default for RapidRandomState

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for RapidRandomState

fn eq(&self, other: &RapidRandomState) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for RapidRandomState

impl Eq for RapidRandomState

impl StructuralPartialEq for RapidRandomState