Struct LtHash

pub struct LtHash(pub [u16; 1024]);

A 16-bit, 1024 element lattice-based incremental hash based on blake3

Tuple Fields

0: [u16; 1024]

Implementations

impl LtHash

pub const NUM_ELEMENTS: usize = 1_024usize

pub const fn identity() -> Self

Returns the identity value for LtHash

pub fn with(hasher: &Hasher) -> Self

Creates a new LtHash from hasher

The caller should hash in all inputs of interest prior to calling.

pub fn mix_in(&mut self, other: &Self)

Mixes other into self

This can be thought of as akin to ‘insert’

pub fn mix_out(&mut self, other: &Self)

Mixes other out of self

This can be thought of as akin to ‘remove’

pub fn checksum(&self) -> Checksum

Computes a checksum of the LtHash

Trait Implementations

impl Clone for LtHash

fn clone(&self) -> LtHash

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for LtHash

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

Formats the value using the given formatter.

impl Display for LtHash

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

Formats the value using the given formatter.

impl PartialEq for LtHash

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

impl StructuralPartialEq for LtHash