Struct ed25519_dalek::pkcs8::spki::AlgorithmIdentifier
pub struct AlgorithmIdentifier<'a> {
pub oid: ObjectIdentifier,
pub parameters: Option<AnyRef<'a>>,
}
pkcs8
only.Expand description
X.509 AlgorithmIdentifier
as defined in RFC 5280 Section 4.1.1.2.
AlgorithmIdentifier ::= SEQUENCE {
algorithm OBJECT IDENTIFIER,
parameters ANY DEFINED BY algorithm OPTIONAL }
Fields§
§oid: ObjectIdentifier
Algorithm OID, i.e. the algorithm
field in the AlgorithmIdentifier
ASN.1 schema.
parameters: Option<AnyRef<'a>>
Algorithm parameters
.
Implementations§
§impl<'a> AlgorithmIdentifier<'a>
impl<'a> AlgorithmIdentifier<'a>
pub fn assert_algorithm_oid(
&self,
expected_oid: ObjectIdentifier
) -> Result<ObjectIdentifier, Error>
pub fn assert_algorithm_oid(
&self,
expected_oid: ObjectIdentifier
) -> Result<ObjectIdentifier, Error>
Assert the algorithm
OID is an expected value.
pub fn assert_parameters_oid(
&self,
expected_oid: ObjectIdentifier
) -> Result<ObjectIdentifier, Error>
pub fn assert_parameters_oid(
&self,
expected_oid: ObjectIdentifier
) -> Result<ObjectIdentifier, Error>
Assert parameters
is an OID and has the expected value.
pub fn assert_oids(
&self,
algorithm: ObjectIdentifier,
parameters: ObjectIdentifier
) -> Result<(), Error>
pub fn assert_oids(
&self,
algorithm: ObjectIdentifier,
parameters: ObjectIdentifier
) -> Result<(), Error>
Assert the values of the algorithm
and parameters
OIDs.
pub fn parameters_any(&self) -> Result<AnyRef<'a>, Error>
pub fn parameters_any(&self) -> Result<AnyRef<'a>, Error>
Get the parameters
field as an AnyRef
.
Returns an error if parameters
are None
.
pub fn parameters_oid(&self) -> Result<ObjectIdentifier, Error>
pub fn parameters_oid(&self) -> Result<ObjectIdentifier, Error>
Get the parameters
field as an ObjectIdentifier
.
Returns an error if it is absent or not an OID.
pub fn oids(
&self
) -> Result<(ObjectIdentifier, Option<ObjectIdentifier>), Error>
pub fn oids(
&self
) -> Result<(ObjectIdentifier, Option<ObjectIdentifier>), Error>
Convert to a pair of ObjectIdentifier
s.
This method is helpful for decomposing in match statements. Note in
particular that NULL
parameters are treated the same as missing
parameters.
Returns an error if parameters are present but not an OID.
Trait Implementations§
§impl<'a> Clone for AlgorithmIdentifier<'a>
impl<'a> Clone for AlgorithmIdentifier<'a>
§fn clone(&self) -> AlgorithmIdentifier<'a>
fn clone(&self) -> AlgorithmIdentifier<'a>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read more§impl<'a> Debug for AlgorithmIdentifier<'a>
impl<'a> Debug for AlgorithmIdentifier<'a>
§impl<'a> DecodeValue<'a> for AlgorithmIdentifier<'a>
impl<'a> DecodeValue<'a> for AlgorithmIdentifier<'a>
§fn decode_value<R>(
reader: &mut R,
header: Header
) -> Result<AlgorithmIdentifier<'a>, Error>where
R: Reader<'a>,
fn decode_value<R>(
reader: &mut R,
header: Header
) -> Result<AlgorithmIdentifier<'a>, Error>where
R: Reader<'a>,
Reader
.§impl<'a> Ord for AlgorithmIdentifier<'a>
impl<'a> Ord for AlgorithmIdentifier<'a>
§fn cmp(&self, other: &AlgorithmIdentifier<'a>) -> Ordering
fn cmp(&self, other: &AlgorithmIdentifier<'a>) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
§impl<'a> PartialEq<AlgorithmIdentifier<'a>> for AlgorithmIdentifier<'a>
impl<'a> PartialEq<AlgorithmIdentifier<'a>> for AlgorithmIdentifier<'a>
§fn eq(&self, other: &AlgorithmIdentifier<'a>) -> bool
fn eq(&self, other: &AlgorithmIdentifier<'a>) -> bool
self
and other
values to be equal, and is used
by ==
.§impl<'a> PartialOrd<AlgorithmIdentifier<'a>> for AlgorithmIdentifier<'a>
impl<'a> PartialOrd<AlgorithmIdentifier<'a>> for AlgorithmIdentifier<'a>
§fn partial_cmp(&self, other: &AlgorithmIdentifier<'a>) -> Option<Ordering>
fn partial_cmp(&self, other: &AlgorithmIdentifier<'a>) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
self
and other
) and is used by the <=
operator. Read more§impl<'a> Sequence<'a> for AlgorithmIdentifier<'a>
impl<'a> Sequence<'a> for AlgorithmIdentifier<'a>
§impl<'a> TryFrom<&'a [u8]> for AlgorithmIdentifier<'a>
impl<'a> TryFrom<&'a [u8]> for AlgorithmIdentifier<'a>
§impl ValueOrd for AlgorithmIdentifier<'_>
impl ValueOrd for AlgorithmIdentifier<'_>
impl<'a> Copy for AlgorithmIdentifier<'a>
impl<'a> Eq for AlgorithmIdentifier<'a>
impl<'a> StructuralEq for AlgorithmIdentifier<'a>
impl<'a> StructuralPartialEq for AlgorithmIdentifier<'a>
Auto Trait Implementations§
impl<'a> RefUnwindSafe for AlgorithmIdentifier<'a>
impl<'a> Send for AlgorithmIdentifier<'a>
impl<'a> Sync for AlgorithmIdentifier<'a>
impl<'a> Unpin for AlgorithmIdentifier<'a>
impl<'a> UnwindSafe for AlgorithmIdentifier<'a>
Blanket Implementations§
§impl<'a, T> Choice<'a> for Twhere
T: Decode<'a> + FixedTag,
impl<'a, T> Choice<'a> for Twhere
T: Decode<'a> + FixedTag,
§fn can_decode(tag: Tag) -> bool
fn can_decode(tag: Tag) -> bool
Tag
decodable as a variant of this CHOICE
?§impl<'a, T> Decode<'a> for Twhere
T: DecodeValue<'a> + FixedTag,
impl<'a, T> Decode<'a> for Twhere
T: DecodeValue<'a> + FixedTag,
§impl<T> DerOrd for Twhere
T: EncodeValue + ValueOrd + Tagged,
impl<T> DerOrd for Twhere
T: EncodeValue + ValueOrd + Tagged,
§impl<T> Encode for Twhere
T: EncodeValue + Tagged,
impl<T> Encode for Twhere
T: EncodeValue + Tagged,
§fn encoded_len(&self) -> Result<Length, Error>
fn encoded_len(&self) -> Result<Length, Error>
Compute the length of this value in bytes when encoded as ASN.1 DER.
§fn encode(&self, writer: &mut dyn Writer) -> Result<(), Error>
fn encode(&self, writer: &mut dyn Writer) -> Result<(), Error>
Encode this value as ASN.1 DER using the provided Writer
.