pub struct U24Le;Expand description
Combinator for parsing and serializing unsigned u24 integers in little-endian byte order.
Trait Implementations§
Source§impl<'x> Combinator<'x, &[u8], Vec<u8>> for U24Le
impl<'x> Combinator<'x, &[u8], Vec<u8>> for U24Le
Source§exec fn serialize(
&self,
v: Self::SType,
data: &mut Vec<u8>,
pos: usize,
) -> res : Result<usize, SerializeError>
exec fn serialize( &self, v: Self::SType, data: &mut Vec<u8>, pos: usize, ) -> res : Result<usize, SerializeError>
Source§type SType = &'x u24
type SType = &'x u24
The input type of serialization, often a reference to
Self::Type.
For “structural” formats though (e.g., crate::regular::sequence::Pair and crate::regular::variant::Choice),
this is the tuple/sum of the corresponding Combinator::SType types.Source§fn ex_requires(&self) -> bool
fn ex_requires(&self) -> bool
Source§impl SecureSpecCombinator for U24Le
impl SecureSpecCombinator for U24Le
Source§open spec fn is_prefix_secure() -> bool
open spec fn is_prefix_secure() -> bool
{ true }Source§open spec fn is_productive(&self) -> bool
open spec fn is_productive(&self) -> bool
{ true }Source§proof fn lemma_prefix_secure(&self, s1: Seq<u8>, s2: Seq<u8>)
proof fn lemma_prefix_secure(&self, s1: Seq<u8>, s2: Seq<u8>)
Source§proof fn theorem_serialize_parse_roundtrip(&self, v: u24)
proof fn theorem_serialize_parse_roundtrip(&self, v: u24)
Source§proof fn theorem_parse_serialize_roundtrip(&self, s: Seq<u8>)
proof fn theorem_parse_serialize_roundtrip(&self, s: Seq<u8>)
Source§proof fn lemma_parse_length(&self, s: Seq<u8>)
proof fn lemma_parse_length(&self, s: Seq<u8>)
Source§proof fn lemma_parse_productive(&self, s: Seq<u8>)
proof fn lemma_parse_productive(&self, s: Seq<u8>)
Source§fn corollary_parse_surjective(&self, v: Self::Type)
fn corollary_parse_surjective(&self, v: Self::Type)
Source§fn corollary_serialize_injective_contraposition(
&self,
v1: Self::Type,
v2: Self::Type,
)
fn corollary_serialize_injective_contraposition( &self, v1: Self::Type, v2: Self::Type, )
Source§fn lemma_serialize_productive(&self, v: Self::Type)
fn lemma_serialize_productive(&self, v: Self::Type)
Source§impl SpecCombinator for U24Le
impl SpecCombinator for U24Le
Source§open spec fn spec_parse(&self, s: Seq<u8>) -> Option<(int, u24)>
open spec fn spec_parse(&self, s: Seq<u8>) -> Option<(int, u24)>
{
match Fixed::<3>.spec_parse(s) {
Some((n, bytes)) => Some((n, u24([bytes[2], bytes[1], bytes[0]]))),
_ => None,
}
}Source§open spec fn spec_serialize(&self, v: u24) -> Seq<u8>
open spec fn spec_serialize(&self, v: u24) -> Seq<u8>
{
let bytes = v.0;
Fixed::<3>.spec_serialize([bytes[2], bytes[1], bytes[0]]@)
}Auto Trait Implementations§
impl Freeze for U24Le
impl RefUnwindSafe for U24Le
impl Send for U24Le
impl Sync for U24Le
impl Unpin for U24Le
impl UnwindSafe for U24Le
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
§impl<T, VERUS_SPEC__A> FromSpec<T> for VERUS_SPEC__Awhere
VERUS_SPEC__A: From<T>,
impl<T, VERUS_SPEC__A> FromSpec<T> for VERUS_SPEC__Awhere
VERUS_SPEC__A: From<T>,
fn obeys_from_spec() -> bool
fn from_spec(v: T) -> VERUS_SPEC__A
§impl<T, VERUS_SPEC__A> IntoSpec<T> for VERUS_SPEC__Awhere
VERUS_SPEC__A: Into<T>,
impl<T, VERUS_SPEC__A> IntoSpec<T> for VERUS_SPEC__Awhere
VERUS_SPEC__A: Into<T>,
fn obeys_into_spec() -> bool
fn into_spec(self) -> T
§impl<T, U> IntoSpecImpl<U> for Twhere
U: From<T>,
impl<T, U> IntoSpecImpl<U> for Twhere
U: From<T>,
fn obeys_into_spec() -> bool
fn into_spec(self) -> U
Source§impl<T, U> SpecTryInto<U> for Twhere
U: SpecTryFrom<T>,
impl<T, U> SpecTryInto<U> for Twhere
U: SpecTryFrom<T>,
Source§open spec fn spec_try_into(self) -> Result<U, <U as SpecTryFrom<T>>::Error>
open spec fn spec_try_into(self) -> Result<U, <U as SpecTryFrom<T>>::Error>
{ U::spec_try_from(self) }Source§type Error = <U as SpecTryFrom<T>>::Error
type Error = <U as SpecTryFrom<T>>::Error
The type returned in the event of a conversion error.