Struct ParallelDigestAdapter 

pub struct ParallelDigestAdapter<D>(/* private fields */);

Adapts a sequential [Digest] into a ParallelDigest that hashes one leaf per element of a parallel iterator.

Each Rayon work-item is seeded with a single hasher (via for_each_with) which is recycled in place with finalize_reset between leaves, rather than cloning a fresh hasher per leaf. This requires D: FixedOutputReset.

Trait Implementations

impl<D> Default for ParallelDigestAdapter<D>

fn default() -> Self

Returns the “default value” for a type.

impl<D> ParallelDigest for ParallelDigestAdapter<D>

where D: Digest + FixedOutputReset + BlockSizeUser + Send + Sync + Clone,

type Digest = D

The corresponding non-parallelized hash function.

fn new() -> Self

Create new hasher instance with empty state.

fn digest<I: IntoIterator<Item: SerializeBytes>>( &self, source: impl IndexedParallelIterator<Item = I>, out: &mut [MaybeUninit<Output<Self::Digest>>], )

Calculate the digest of multiple hashes by processing a parallel iterator of iterators.

fn digest_with_const_len<I: IntoIterator<Item: FixedSizeSerializeBytes>>( &self, n_items_per_input: usize, source: impl IndexedParallelIterator<Item = I>, out: &mut [MaybeUninit<Output<Self::Digest>>], )

Like digest, but specialized for the case where every leaf is built from exactly n_items_per_input items of a [FixedSizeSerializeBytes] type, so that each leaf has the same, compile-time-derivable byte length.