Struct PortableBlake3ParallelDigest 

pub struct PortableBlake3ParallelDigest<const LANES: usize>;

Parallel Blake3 leaf digest backed by the portable auto-vectorized kernel.

LANES is the batch width handed to the vectorizer. Leaf size decides the path:

• Up to one 1024-byte chunk (any length): batched through the portable kernel.
• Larger (multi-chunk): hashed on its own by the scalar adapter, which walks the tree.

Trait Implementations

impl<const LANES: usize> Clone for PortableBlake3ParallelDigest<LANES>

fn clone(&self) -> PortableBlake3ParallelDigest<LANES>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const LANES: usize> Debug for PortableBlake3ParallelDigest<LANES>

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

Formats the value using the given formatter.

impl<const LANES: usize> Default for PortableBlake3ParallelDigest<LANES>

fn default() -> PortableBlake3ParallelDigest<LANES>

Returns the “default value” for a type.

impl<const LANES: usize> ParallelDigest for PortableBlake3ParallelDigest<LANES>

type Digest = Hasher

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.