Struct rasn_cms::AlgorithmIdentifier

pub struct AlgorithmIdentifier {
    pub algorithm: ObjectIdentifier,
    pub parameters: Option<Any>,
}

Identifies what algorithm was used, along with any parameters used as input.

Fields

algorithm: ObjectIdentifier

The identifier for the algorithm.

parameters: Option<Any>

Parameters for the algorithm, if any.

Trait Implementations

impl AsnType for AlgorithmIdentifier

const TAG: Tag = { { const LIST: &'static [rasn::TagTree] = &[<Option<Any> as rasn::AsnType>::TAG_TREE]; const TAG_TREE: rasn::TagTree = rasn::TagTree::Choice(LIST); const _: () = if !TAG_TREE.is_unique() { { ::core::panicking::panic_fmt(<#[lang = "format_arguments"]>::new_const(&["AlgorithmIdentifier\'s fields is not a valid order of ASN.1 tags, ensure that your field\'s tags and OPTIONALs are correct."])); } }; } rasn::Tag::SEQUENCE }

The associated tag for the type.

const TAG_TREE: TagTree = TagTree::Leaf(Self::TAG)

The root of this type’s tree of tag’s if it a CHOICE type, otherwise its Leaf that points Self::TAG.

const CONSTRAINTS: Constraints<'static> = Constraints::NONE

impl Clone for AlgorithmIdentifier

fn clone(&self) -> AlgorithmIdentifier

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Constructed for AlgorithmIdentifier

const FIELDS: Fields = rasn::types::fields::Fields::from_static(&[{ rasn::types::fields::Field::new_required(<ObjectIdentifier as rasn::AsnType>::TAG, <ObjectIdentifier as rasn::AsnType>::TAG_TREE) }, { rasn::types::fields::Field::new_optional(<Option<Any> as rasn::AsnType>::TAG, <Option<Any> as rasn::AsnType>::TAG_TREE) }])

Fields contained in the “root component list”.

const EXTENDED_FIELDS: Option<Fields> = None

Fields contained in the list of extensions.

impl Debug for AlgorithmIdentifier

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

Formats the value using the given formatter.

impl Decode for AlgorithmIdentifier

fn decode_with_tag_and_constraints<D, 'constraints>( decoder: &mut D, tag: Tag, constraints: Constraints<'constraints> ) -> Result<AlgorithmIdentifier, <D as Decoder>::Error>where D: Decoder,

fn decode<D>(decoder: &mut D) -> Result<Self, <D as Decoder>::Error>where D: Decoder,

Decode this value from a given ASN.1 decoder.

fn decode_with_tag<D>( decoder: &mut D, tag: Tag ) -> Result<Self, <D as Decoder>::Error>where D: Decoder,

Decode this value implicitly tagged with tag from a given ASN.1 decoder.

fn decode_with_constraints<D>( decoder: &mut D, constraints: Constraints<'_> ) -> Result<Self, <D as Decoder>::Error>where D: Decoder,

impl Encode for AlgorithmIdentifier

fn encode_with_tag_and_constraints<EN, 'constraints>( &self, encoder: &mut EN, tag: Tag, constraints: Constraints<'constraints> ) -> Result<(), <EN as Encoder>::Error>where EN: Encoder,

fn encode<E>(&self, encoder: &mut E) -> Result<(), <E as Encoder>::Error>where E: Encoder,

Encodes self’s data into the given Encoder.

fn encode_with_tag<E>( &self, encoder: &mut E, tag: Tag ) -> Result<(), <E as Encoder>::Error>where E: Encoder,

Encode this value with tag into the given Encoder.

fn encode_with_constraints<E>( &self, encoder: &mut E, constraints: Constraints<'_> ) -> Result<(), <E as Encoder>::Error>where E: Encoder,

impl Hash for AlgorithmIdentifier

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 AlgorithmIdentifier

fn cmp(&self, other: &AlgorithmIdentifier) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl PartialEq<AlgorithmIdentifier> for AlgorithmIdentifier

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd<AlgorithmIdentifier> for AlgorithmIdentifier

fn partial_cmp(&self, other: &AlgorithmIdentifier) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl Eq for AlgorithmIdentifier

impl StructuralEq for AlgorithmIdentifier

impl StructuralPartialEq for AlgorithmIdentifier