Struct AlgorithmName 

pub struct AlgorithmName { /* private fields */ }

Available on crate feature alloc only.

A string representing an additional algorithm name in the name@domainname format (see RFC4251 § 6).

Additional algorithm names must be non-empty printable ASCII strings no longer than 64 characters.

This also provides a name-cert-v01@domainnname string identifier for the corresponding OpenSSH certificate format, derived from the specified name@domainname string.

NOTE: RFC4251 specifies additional validation criteria for algorithm names, but we do not implement all of them here.

Implementations

impl AlgorithmName

pub fn new(id: impl Into<String>) -> Result<Self, LabelError>

Create a new algorithm identifier.

Errors

Returns LabelError in the event the identifier is invalid.

pub fn as_str(&self) -> &str

Get the string identifier which corresponds to this algorithm name.

pub fn certificate_type(&self) -> String

Get the string identifier which corresponds to the OpenSSH certificate format.

pub fn from_certificate_type(id: &str) -> Result<Self, LabelError>

Create a new AlgorithmName from an OpenSSH certificate format string identifier.

Errors

Returns LabelError in the event the identifier is invalid.

Trait Implementations

impl Clone for AlgorithmName

fn clone(&self) -> AlgorithmName

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AlgorithmName

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

Formats the value using the given formatter.

impl FromStr for AlgorithmName

type Err = LabelError

The associated error which can be returned from parsing.

fn from_str(id: &str) -> Result<Self, LabelError>

Parses a string s to return a value of this type.

impl Hash for AlgorithmName

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 AlgorithmName

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

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

fn partial_cmp(&self, other: &AlgorithmName) -> 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 Eq for AlgorithmName

impl StructuralPartialEq for AlgorithmName