Enum Algorithm 

#[repr(u32)]
pub enum Algorithm {
    Argon2d = 0,
    Argon2i = 1,
    Argon2id = 2,
}

The Argon2 primitive type (argon2_type).

The numeric values matter: initial_hash hashes them, and fill_segment puts instance->type into input_block.v[5].

Variants

Argon2d = 0

Argon2_d (0): data-dependent addressing.

Argon2i = 1

Argon2_i (1): data-independent addressing.

Argon2id = 2

Argon2_id (2): first half-pass independent, rest dependent. The default.

Implementations

impl Algorithm

pub const ALL: [Algorithm; 3]

All three variants, in argon2_type order.

pub const fn as_u32(self) -> u32

The argon2_type numeric value.

pub const fn from_u32(value: u32) -> Option<Algorithm>

Parse an argon2_type numeric value.

pub const fn as_str(self) -> &'static str

argon2_type2string(type, 0): the lowercase name used in PHC strings.

Note "argon2i" is a prefix of "argon2id"; the C decoder relies on the next character failing to parse, and the Rust decoder must too.

pub const fn as_str_uppercase(self) -> &'static str

argon2_type2string(type, 1): the capitalised name (used by genkat).

Trait Implementations

impl Clone for Algorithm

fn clone(&self) -> Algorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Algorithm

impl Debug for Algorithm

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

Formats the value using the given formatter.

impl Default for Algorithm

fn default() -> Algorithm

Returns the “default value” for a type.

impl Eq for Algorithm

impl Hash for Algorithm

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 Ord for Algorithm

fn cmp(&self, other: &Algorithm) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for Algorithm

fn eq(&self, other: &Algorithm) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl PartialOrd for Algorithm

fn partial_cmp(&self, other: &Algorithm) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl StructuralPartialEq for Algorithm