Struct Algorithm

pub struct Algorithm { /* private fields */ }

An algorithm is the combination of the AlgorithmId and its parameters.

Implementations

impl Algorithm

pub fn new<'a, T>(algorithm: AlgorithmId, parameters: T) -> Self

where T: Into<Option<&'a [u8]>>,

Creates a new algorithm with parameters.

Attributes:

• algorithm - The Algorithm.
• parameters - Specific parameters for the algorithm, if any.

pub fn algorithm(&self) -> AlgorithmId

Returns the algorithm

pub fn parameters(&self) -> Option<&[u8]>

Returns the parameters required by the algorithm.

Trait Implementations

impl AsRef<Algorithm> for Algorithm

fn as_ref(&self) -> &Algorithm

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Algorithm> for PasswordAlgorithm

fn as_ref(&self) -> &Algorithm

Converts this type into a shared reference of the (usually inferred) input type.

impl Clone for Algorithm

fn clone(&self) -> Algorithm

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Algorithm

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

Formats the value using the given formatter.

impl From<AlgorithmId> for Algorithm

fn from(algorithm: AlgorithmId) -> Self

Converts to this type from the input type.

impl PartialEq for Algorithm

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

impl StructuralPartialEq for Algorithm