#[non_exhaustive]pub enum AidAlgorithm {
Ed25519,
P256,
}Expand description
Algorithm of the public key bound to an AID.
Marked #[non_exhaustive] so future suites (e.g. Ed448, post-quantum
candidates) can be added in a minor release without forcing
downstream code to upgrade.
Variants (Non-exhaustive)§
This enum is marked as 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
Ed25519 (RFC 8032). Identifier is the 32-byte raw public key.
P256
ECDSA on P-256 with SHA-256. Identifier is the 33-byte SEC1 compressed point.
Implementations§
Trait Implementations§
Source§impl Clone for AidAlgorithm
impl Clone for AidAlgorithm
Source§fn clone(&self) -> AidAlgorithm
fn clone(&self) -> AidAlgorithm
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreimpl Copy for AidAlgorithm
Source§impl Debug for AidAlgorithm
impl Debug for AidAlgorithm
impl Eq for AidAlgorithm
Source§impl Hash for AidAlgorithm
impl Hash for AidAlgorithm
Source§impl PartialEq for AidAlgorithm
impl PartialEq for AidAlgorithm
impl StructuralPartialEq for AidAlgorithm
Auto Trait Implementations§
impl Freeze for AidAlgorithm
impl RefUnwindSafe for AidAlgorithm
impl Send for AidAlgorithm
impl Sync for AidAlgorithm
impl Unpin for AidAlgorithm
impl UnsafeUnpin for AidAlgorithm
impl UnwindSafe for AidAlgorithm
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.