Enum Algorithm 

#[non_exhaustive]
pub enum Algorithm {
    Ed25519,
    Es256,
}

The fully-specified signature algorithms this crate signs and verifies.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Ed25519

EdDSA over Ed25519 (RFC 9864’s Ed25519): what this crate signs with.

Es256

ECDSA over P-256 with SHA-256.

Implementations

impl Algorithm

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

Its JOSE name.

pub fn from_name(name: &str) -> Option<Self>

The algorithm a JOSE name names, among those supported.

Trait Implementations

impl Clone for Algorithm

fn clone(&self) -> Self

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

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Algorithm