Struct Sequence
pub struct Sequence<'a> {
pub content: Cow<'a, [u8]>,
}
Expand description
The SEQUENCE
object is an ordered list of heteregeneous types.
Sequences can usually be of 2 types:
- a list of different objects (
SEQUENCE
, usually parsed as astruct
) - a list of similar objects (
SEQUENCE OF
, usually parsed as aVec<T>
)
The current object covers the former. For the latter, see the SequenceOf
documentation.
The Sequence
object contains the (unparsed) encoded representation of its content. It provides
methods to parse and iterate contained objects, or convert the sequence to other types.
§Building a Sequence
To build a DER sequence:
- if the sequence is composed of objects of the same type, the
Sequence::from_iter_to_der
method can be used - otherwise, the
ToDer
trait can be used to create content incrementally
use asn1_rs::{Integer, Sequence, SerializeResult, ToDer};
fn build_seq<'a>() -> SerializeResult<Sequence<'a>> {
let mut v = Vec::new();
// add an Integer object (construct type):
let i = Integer::from_u32(4);
let _ = i.write_der(&mut v)?;
// some primitive objects also implement `ToDer`. A string will be mapped as `Utf8String`:
let _ = "abcd".write_der(&mut v)?;
// return the sequence built from the DER content
Ok(Sequence::new(v.into()))
}
let seq = build_seq().unwrap();
§Examples
use asn1_rs::{Error, Sequence};
// build sequence
let it = [2, 3, 4].iter();
let seq = Sequence::from_iter_to_der(it).unwrap();
// `seq` now contains the serialized DER representation of the array
// iterate objects
let mut sum = 0;
for item in seq.der_iter::<u32, Error>() {
// item has type `Result<u32>`, since parsing the serialized bytes could fail
sum += item.expect("parsing list item failed");
}
assert_eq!(sum, 9);
Note: the above example encodes a SEQUENCE OF INTEGER
object, the SequenceOf
object could
be used to provide a simpler API.
Fields§
§content: Cow<'a, [u8]>
Serialized DER representation of the sequence content
Implementations§
§impl<'a> Sequence<'a>
impl<'a> Sequence<'a>
pub const fn new(content: Cow<'a, [u8]>) -> Sequence<'a>
pub const fn new(content: Cow<'a, [u8]>) -> Sequence<'a>
Build a sequence, given the provided content
pub fn into_content(self) -> Cow<'a, [u8]>
pub fn into_content(self) -> Cow<'a, [u8]>
Consume the sequence and return the content
pub fn and_then<U, F, E>(self, op: F) -> Result<(&'a [u8], U), Err<E>>
pub fn and_then<U, F, E>(self, op: F) -> Result<(&'a [u8], U), Err<E>>
Apply the parsing function to the sequence content, consuming the sequence
Note: this function expects the caller to take ownership of content. In some cases, handling the lifetime of objects is not easy (when keeping only references on data). Other methods are provided (depending on the use case):
Sequence::parse
takes a reference on the sequence data, but does not consume it,Sequence::from_der_and_then
does the parsing of the sequence and applying the function in one step, ensuring there are only references (and dropping the temporary sequence).
pub fn from_ber_and_then<U, F, E>(
bytes: &'a [u8],
op: F,
) -> Result<(&'a [u8], U), Err<E>>
pub fn from_ber_and_then<U, F, E>( bytes: &'a [u8], op: F, ) -> Result<(&'a [u8], U), Err<E>>
Same as Sequence::from_der_and_then
, but using BER encoding (no constraints).
pub fn from_der_and_then<U, F, E>(
bytes: &'a [u8],
op: F,
) -> Result<(&'a [u8], U), Err<E>>
pub fn from_der_and_then<U, F, E>( bytes: &'a [u8], op: F, ) -> Result<(&'a [u8], U), Err<E>>
Parse a DER sequence and apply the provided parsing function to content
After parsing, the sequence object and header are discarded.
use asn1_rs::{FromDer, ParseResult, Sequence};
// Parse a SEQUENCE {
// a INTEGER (0..255),
// b INTEGER (0..4294967296)
// }
// and return only `(a,b)
fn parser(i: &[u8]) -> ParseResult<(u8, u32)> {
Sequence::from_der_and_then(i, |i| {
let (i, a) = u8::from_der(i)?;
let (i, b) = u32::from_der(i)?;
Ok((i, (a, b)))
}
)
}
pub fn parse<F, T, E>(&'a self, f: F) -> Result<(&'a [u8], T), Err<E>>
pub fn parse<F, T, E>(&'a self, f: F) -> Result<(&'a [u8], T), Err<E>>
Apply the parsing function to the sequence content (non-consuming version)
pub fn parse_into<F, T, E>(self, f: F) -> Result<(&'a [u8], T), Err<E>>
pub fn parse_into<F, T, E>(self, f: F) -> Result<(&'a [u8], T), Err<E>>
Apply the parsing function to the sequence content (consuming version)
Note: to parse and apply a parsing function in one step, use the
Sequence::from_der_and_then
method.
§Limitations
This function fails if the sequence contains Owned
data, because the parsing function
takes a reference on data (which is dropped).
pub fn ber_iter<T, E>(&'a self) -> SequenceIterator<'a, T, BerParser, E>where
T: FromBer<'a, E>,
pub fn ber_iter<T, E>(&'a self) -> SequenceIterator<'a, T, BerParser, E>where
T: FromBer<'a, E>,
Return an iterator over the sequence content, attempting to decode objects as BER
This method can be used when all objects from the sequence have the same type.
pub fn der_iter<T, E>(&'a self) -> SequenceIterator<'a, T, DerParser, E>where
T: FromDer<'a, E>,
pub fn der_iter<T, E>(&'a self) -> SequenceIterator<'a, T, DerParser, E>where
T: FromDer<'a, E>,
Return an iterator over the sequence content, attempting to decode objects as DER
This method can be used when all objects from the sequence have the same type.
pub fn ber_sequence_of<T, E>(&'a self) -> Result<Vec<T>, E>
pub fn ber_sequence_of<T, E>(&'a self) -> Result<Vec<T>, E>
Attempt to parse the sequence as a SEQUENCE OF
items (BER), and return the parsed items as a Vec
.
pub fn der_sequence_of<T, E>(&'a self) -> Result<Vec<T>, E>
pub fn der_sequence_of<T, E>(&'a self) -> Result<Vec<T>, E>
Attempt to parse the sequence as a SEQUENCE OF
items (DER), and return the parsed items as a Vec
.
pub fn into_ber_sequence_of<T, U, E>(self) -> Result<Vec<T>, E>
pub fn into_ber_sequence_of<T, U, E>(self) -> Result<Vec<T>, E>
Attempt to parse the sequence as a SEQUENCE OF
items (BER) (consuming input),
and return the parsed items as a Vec
.
Note: if Self
is an Owned
object, the data will be duplicated (causing allocations) into separate objects.
pub fn into_der_sequence_of<T, U, E>(self) -> Result<Vec<T>, E>
pub fn into_der_sequence_of<T, U, E>(self) -> Result<Vec<T>, E>
Attempt to parse the sequence as a SEQUENCE OF
items (DER) (consuming input),
and return the parsed items as a Vec
.
Note: if Self
is an Owned
object, the data will be duplicated (causing allocations) into separate objects.
pub fn into_der_sequence_of_ref<T, E>(self) -> Result<Vec<T>, E>
§impl Sequence<'_>
impl Sequence<'_>
pub fn from_iter_to_der<T, IT>(it: IT) -> Result<Sequence<'_>, SerializeError>
pub fn from_iter_to_der<T, IT>(it: IT) -> Result<Sequence<'_>, SerializeError>
Attempt to create a Sequence
from an iterator over serializable objects (to DER)
§Examples
use asn1_rs::Sequence;
// build sequence
let it = [2, 3, 4].iter();
let seq = Sequence::from_iter_to_der(it).unwrap();
Trait Implementations§
§impl CheckDerConstraints for Sequence<'_>
impl CheckDerConstraints for Sequence<'_>
§impl ToDer for Sequence<'_>
impl ToDer for Sequence<'_>
§fn to_der_len(&self) -> Result<usize, Error>
fn to_der_len(&self) -> Result<usize, Error>
§fn write_der_header(
&self,
writer: &mut dyn Write,
) -> Result<usize, SerializeError>
fn write_der_header( &self, writer: &mut dyn Write, ) -> Result<usize, SerializeError>
§fn write_der_content(
&self,
writer: &mut dyn Write,
) -> Result<usize, SerializeError>
fn write_der_content( &self, writer: &mut dyn Write, ) -> Result<usize, SerializeError>
§fn to_der_vec(&self) -> Result<Vec<u8>, SerializeError>
fn to_der_vec(&self) -> Result<Vec<u8>, SerializeError>
Vec<u8>
.§fn to_der_vec_raw(&self) -> Result<Vec<u8>, SerializeError>
fn to_der_vec_raw(&self) -> Result<Vec<u8>, SerializeError>
to_vec
, but uses provided values without changes.
This can generate an invalid encoding for a DER object.§fn write_der(&self, writer: &mut dyn Write) -> Result<usize, SerializeError>
fn write_der(&self, writer: &mut dyn Write) -> Result<usize, SerializeError>
§fn write_der_raw(&self, writer: &mut dyn Write) -> Result<usize, SerializeError>
fn write_der_raw(&self, writer: &mut dyn Write) -> Result<usize, SerializeError>
to_der
, but uses provided values without changes.
This can generate an invalid encoding for a DER object.impl DerAutoDerive for Sequence<'_>
impl<'a> Eq for Sequence<'a>
impl<'a> StructuralPartialEq for Sequence<'a>
Auto Trait Implementations§
impl<'a> Freeze for Sequence<'a>
impl<'a> RefUnwindSafe for Sequence<'a>
impl<'a> Send for Sequence<'a>
impl<'a> Sync for Sequence<'a>
impl<'a> Unpin for Sequence<'a>
impl<'a> UnwindSafe for Sequence<'a>
Blanket Implementations§
§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
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
§impl<T> Choice for Twhere
T: Tagged,
impl<T> Choice for Twhere
T: Tagged,
§fn can_decode(tag: Tag) -> bool
fn can_decode(tag: Tag) -> bool
Tag
decodable as a variant of this CHOICE
?Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.§impl<'a, T, E> FromDer<'a, E> for Twhere
T: TryFrom<Any<'a>, Error = E> + CheckDerConstraints + DerAutoDerive,
E: From<Error> + Display + Debug,
impl<'a, T, E> FromDer<'a, E> for Twhere
T: TryFrom<Any<'a>, Error = E> + CheckDerConstraints + DerAutoDerive,
E: From<Error> + Display + Debug,
§impl<T> FutureExt for T
impl<T> FutureExt for T
§fn with_context(self, otel_cx: Context) -> WithContext<Self> ⓘ
fn with_context(self, otel_cx: Context) -> WithContext<Self> ⓘ
§fn with_current_context(self) -> WithContext<Self> ⓘ
fn with_current_context(self) -> WithContext<Self> ⓘ
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
§fn and<P, B, E>(self, other: P) -> And<T, P>
fn and<P, B, E>(self, other: P) -> And<T, P>
Policy
that returns Action::Follow
only if self
and other
return
Action::Follow
. Read more§impl<T, U> RamaTryInto<U> for Twhere
U: RamaTryFrom<T>,
impl<T, U> RamaTryInto<U> for Twhere
U: RamaTryFrom<T>,
type Error = <U as RamaTryFrom<T>>::Error
fn rama_try_into(self) -> Result<U, <U as RamaTryFrom<T>>::Error>
§impl<T, U> RamaTryInto<U> for Twhere
U: RamaTryFrom<T>,
impl<T, U> RamaTryInto<U> for Twhere
U: RamaTryFrom<T>,
type Error = <U as RamaTryFrom<T>>::Error
fn rama_try_into(self) -> Result<U, <U as RamaTryFrom<T>>::Error>
Source§impl<T> ToHex for T
impl<T> ToHex for T
Source§fn encode_hex<U>(&self) -> Uwhere
U: FromIterator<char>,
fn encode_hex<U>(&self) -> Uwhere
U: FromIterator<char>,
self
into the result. Lower case
letters are used (e.g. f9b4ca
)Source§fn encode_hex_upper<U>(&self) -> Uwhere
U: FromIterator<char>,
fn encode_hex_upper<U>(&self) -> Uwhere
U: FromIterator<char>,
self
into the result. Upper case
letters are used (e.g. F9B4CA
)