Struct HashCodeScrambler 

#[repr(C, align(8))]
pub struct HashCodeScrambler {
    pub _bindgen_opaque_blob: [u64; 2],
}

A pseudorandom function mapping 32-bit integers to 32-bit integers.

This is for when you’re feeding private data (like pointer values or credit card numbers) to a non-crypto hash function (like HashBytes) and then using the hash code for something that untrusted parties could observe (like a JS Map). Plug in a HashCodeScrambler before that last step to avoid leaking the private data.

By itself, this does not prevent hash-flooding DoS attacks, because an attacker can still generate many values with exactly equal hash codes by attacking the non-crypto hash function alone. Equal hash codes will, of course, still be equal however much you scramble them.

The algorithm is SipHash-1-3. See https://131002.net/siphash/.

Fields

_bindgen_opaque_blob: [u64; 2]

Trait Implementations

impl Clone for HashCodeScrambler

fn clone(&self) -> HashCodeScrambler

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for HashCodeScrambler

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl PartialEq for HashCodeScrambler

fn eq(&self, other: &HashCodeScrambler) -> 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 HashCodeScrambler

impl StructuralPartialEq for HashCodeScrambler

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 16 bytes