Enum SchnorrAlgorithm

pub enum SchnorrAlgorithm {
    Bip340secp256k1,
    Ed25519,
}

Schnorr Algorithm.

See SchnorrKeyId::algorithm.

Variants

Bip340secp256k1

BIP-340 secp256k1.

Ed25519

ed25519.

Trait Implementations

impl CandidType for SchnorrAlgorithm

fn _ty() -> Type

fn id() -> TypeId

fn idl_serialize<__S>( &self, __serializer: __S, ) -> Result<(), <__S as Serializer>::Error>

where __S: Serializer,

fn ty() -> Type

impl Clone for SchnorrAlgorithm

fn clone(&self) -> SchnorrAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SchnorrAlgorithm

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

Formats the value using the given formatter.

impl Default for SchnorrAlgorithm

fn default() -> SchnorrAlgorithm

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for SchnorrAlgorithm

fn deserialize<__D>( __deserializer: __D, ) -> Result<SchnorrAlgorithm, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Hash for SchnorrAlgorithm

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

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 SchnorrAlgorithm

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

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

Tests for self and other values to be equal, and is used by ==.

const 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 SchnorrAlgorithm

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

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for SchnorrAlgorithm

impl Eq for SchnorrAlgorithm

impl StructuralPartialEq for SchnorrAlgorithm