Struct Blake2s 

pub struct Blake2s<const BITS: usize>;

Blake2s Algorithm parametrized by the number of bits to output

Implementations

impl<const BITS: usize> Blake2s<BITS>

pub const OUTPUT_BITS: usize = BITS

Output of the hashing algorithm in bits

pub const BLOCK_BYTES: usize = Engine::BLOCK_BYTES

The block size in bytes of the algorithm, which is the number of bytes the algorithm typically buffer before calling its compression function

pub fn new() -> Context<BITS>

Create a new context for this algorithm

pub fn new_keyed(key: &[u8]) -> Context<BITS>

Create a new context with a key for this algorithm

Trait Implementations

impl<const BITS: usize> Clone for Blake2s<BITS>

fn clone(&self) -> Blake2s<BITS>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const BITS: usize> Debug for Blake2s<BITS>

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

Formats the value using the given formatter.

impl<const BITS: usize> Hash for Blake2s<BITS>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<const BITS: usize> PartialEq for Blake2s<BITS>

fn eq(&self, other: &Blake2s<BITS>) -> 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<const BITS: usize> Copy for Blake2s<BITS>

impl<const BITS: usize> Eq for Blake2s<BITS>

impl<const BITS: usize> StructuralPartialEq for Blake2s<BITS>