pub struct Array<const N: usize, C>(pub C);Expand description
Exactly N repetitions of combinator C (N is a compile-time constant).
Tuple Fields§
§0: CTrait Implementations§
Source§impl<Inner, T, const N: usize> ByteLen<[T; N]> for Array<N, Inner>where
Inner: ByteLen<T>,
T: DeepView,
impl<Inner, T, const N: usize> ByteLen<[T; N]> for Array<N, Inner>where
Inner: ByteLen<T>,
T: DeepView,
Source§impl<const N: usize, C: Consistency> Consistency for Array<N, C>
impl<const N: usize, C: Consistency> Consistency for Array<N, C>
Source§open spec fn consistent(&self, v: Self::Val) -> bool
open spec fn consistent(&self, v: Self::Val) -> bool
{ super::RepeatN(N, self.0).consistent(v) }Source§type Val = Seq<<C as Consistency>::Val>
type Val = Seq<<C as Consistency>::Val>
The type of values whose consistency is being checked.
Source§impl<const N: usize, C: EquivSerializersGeneral> EquivSerializers for Array<N, C>
impl<const N: usize, C: EquivSerializersGeneral> EquivSerializers for Array<N, C>
Source§impl<const N: usize, C: EquivSerializersGeneral> EquivSerializersGeneral for Array<N, C>
impl<const N: usize, C: EquivSerializersGeneral> EquivSerializersGeneral for Array<N, C>
Source§open spec fn equiv_general_inv(&self) -> bool
open spec fn equiv_general_inv(&self) -> bool
{ self.0.equiv_general_inv() }Source§proof fn lemma_serialize_equiv(&self, v: Self::SVal, obuf: Seq<u8>)
proof fn lemma_serialize_equiv(&self, v: Self::SVal, obuf: Seq<u8>)
Source§impl<const N: usize, C: GoodSerializer> GoodSerializer for Array<N, C>
impl<const N: usize, C: GoodSerializer> GoodSerializer for Array<N, C>
Source§open spec fn serialize_inv(&self) -> bool
open spec fn serialize_inv(&self) -> bool
{ super::RepeatN(N, self.0).serialize_inv() }Source§proof fn lemma_serialize_len(&self, v: Self::SVal)
proof fn lemma_serialize_len(&self, v: Self::SVal)
Source§impl<const N: usize, C: MinMaxByteLen> MinMaxByteLen for Array<N, C>
impl<const N: usize, C: MinMaxByteLen> MinMaxByteLen for Array<N, C>
Source§impl<const N: usize, C: NoLookAhead> NoLookAhead for Array<N, C>
impl<const N: usize, C: NoLookAhead> NoLookAhead for Array<N, C>
Source§open spec fn no_lookahead_inv(&self) -> bool
open spec fn no_lookahead_inv(&self) -> bool
{ self.0.no_lookahead_inv() }Source§proof fn lemma_no_lookahead(&self, i1: Seq<u8>, i2: Seq<u8>)
proof fn lemma_no_lookahead(&self, i1: Seq<u8>, i2: Seq<u8>)
Source§impl<const N: usize, C: NonMalleable> NonMalleable for Array<N, C>
impl<const N: usize, C: NonMalleable> NonMalleable for Array<N, C>
Source§open spec fn nonmal_inv(&self) -> bool
open spec fn nonmal_inv(&self) -> bool
{ super::RepeatN(N, self.0).nonmal_inv() }Source§proof fn lemma_parse_non_malleable(&self, buf1: Seq<u8>, buf2: Seq<u8>)
proof fn lemma_parse_non_malleable(&self, buf1: Seq<u8>, buf2: Seq<u8>)
Source§impl<const N: usize, C: NonTailFmt> NonTailFmt for Array<N, C>
impl<const N: usize, C: NonTailFmt> NonTailFmt for Array<N, C>
Source§open spec fn serialize_dps_inv(&self) -> bool
open spec fn serialize_dps_inv(&self) -> bool
{ super::RepeatN(N, self.0).serialize_dps_inv() }Source§proof fn lemma_serialize_dps_prepend(&self, v: Self::SValue, obuf: Seq<u8>)
proof fn lemma_serialize_dps_prepend(&self, v: Self::SValue, obuf: Seq<u8>)
Source§proof fn lemma_serialize_dps_len(&self, v: Self::SValue, obuf: Seq<u8>)
proof fn lemma_serialize_dps_len(&self, v: Self::SValue, obuf: Seq<u8>)
Source§impl<Inner, T, const N: usize> Prepare<[T; N]> for Array<N, Inner>where
Inner: Prepare<T>,
T: DeepView,
impl<Inner, T, const N: usize> Prepare<[T; N]> for Array<N, Inner>where
Inner: Prepare<T>,
T: DeepView,
Source§impl<const N: usize, C: Productive> Productive for Array<N, C>
impl<const N: usize, C: Productive> Productive for Array<N, C>
Source§open spec fn productive_inv(&self) -> bool
open spec fn productive_inv(&self) -> bool
{ super::RepeatN(N, self.0).productive_inv() }Source§proof fn lemma_productive(&self, s: Seq<u8>)
proof fn lemma_productive(&self, s: Seq<u8>)
Source§impl<const N: usize, C> SPRoundTripDps for Array<N, C>where
C: SPRoundTripDps + NonTailFmt,
impl<const N: usize, C> SPRoundTripDps for Array<N, C>where
C: SPRoundTripDps + NonTailFmt,
Source§open spec fn unambiguous(&self) -> bool
open spec fn unambiguous(&self) -> bool
{ super::RepeatN(N, self.0).unambiguous() }Source§proof fn theorem_serialize_dps_parse_roundtrip(&self, v: Self::T, obuf: Seq<u8>)
proof fn theorem_serialize_dps_parse_roundtrip(&self, v: Self::T, obuf: Seq<u8>)
Source§impl<const N: usize, C: SafeParser> SafeParser for Array<N, C>
impl<const N: usize, C: SafeParser> SafeParser for Array<N, C>
Source§impl<Output: OutputBuf, Inner, T, const N: usize> Serializer<Output, [T; N]> for Array<N, Inner>where
T: DeepView,
Inner: Serializer<Output, T>,
impl<Output: OutputBuf, Inner, T, const N: usize> Serializer<Output, [T; N]> for Array<N, Inner>where
T: DeepView,
Inner: Serializer<Output, T>,
Source§exec fn serialize_into(&self, v: &[T; N], obuf: &mut Output)
exec fn serialize_into(&self, v: &[T; N], obuf: &mut Output)
Source§impl<const N: usize, C: SoundParser> SoundParser for Array<N, C>
impl<const N: usize, C: SoundParser> SoundParser for Array<N, C>
Source§impl<const N: usize, C: SpecByteLen> SpecByteLen for Array<N, C>
impl<const N: usize, C: SpecByteLen> SpecByteLen for Array<N, C>
Source§impl<const N: usize, C: SpecParser> SpecParser for Array<N, C>
impl<const N: usize, C: SpecParser> SpecParser for Array<N, C>
Source§impl<const N: usize, C: SpecSerializer> SpecSerializer for Array<N, C>
impl<const N: usize, C: SpecSerializer> SpecSerializer for Array<N, C>
Source§open spec fn spec_serialize(&self, v: Self::SVal) -> Seq<u8>
open spec fn spec_serialize(&self, v: Self::SVal) -> Seq<u8>
{ super::RepeatN(N, self.0).spec_serialize(v) }Source§type SVal = Seq<<C as SpecSerializer>::SVal>
type SVal = Seq<<C as SpecSerializer>::SVal>
The type of values to be serialized.
Source§impl<const N: usize, C: SpecSerializerDps> SpecSerializerDps for Array<N, C>
impl<const N: usize, C: SpecSerializerDps> SpecSerializerDps for Array<N, C>
Source§impl<const N: usize, C: StaticByteLen> StaticByteLen for Array<N, C>
impl<const N: usize, C: StaticByteLen> StaticByteLen for Array<N, C>
Source§open spec fn static_byte_len() -> nat
open spec fn static_byte_len() -> nat
{ N as nat * C::static_byte_len() }Source§proof fn lemma_static_len_matches_byte_len(&self, v: Self::T)
proof fn lemma_static_len_matches_byte_len(&self, v: Self::T)
Source§impl<const N: usize, C: ValueByteLen> ValueByteLen for Array<N, C>
impl<const N: usize, C: ValueByteLen> ValueByteLen for Array<N, C>
Source§open spec fn value_byte_len(v: Self::T) -> nat
open spec fn value_byte_len(v: Self::T) -> nat
{ <super::Star<C> as ValueByteLen>::value_byte_len(v) }Source§proof fn lemma_value_len_matches_byte_len(&self, v: Self::T)
proof fn lemma_value_len_matches_byte_len(&self, v: Self::T)
impl<const N: usize, C: Copy> Copy for Array<N, C>
Auto Trait Implementations§
impl<const N: usize, C> Freeze for Array<N, C>where
C: Freeze,
impl<const N: usize, C> RefUnwindSafe for Array<N, C>where
C: RefUnwindSafe,
impl<const N: usize, C> Send for Array<N, C>where
C: Send,
impl<const N: usize, C> Sync for Array<N, C>where
C: Sync,
impl<const N: usize, C> Unpin for Array<N, C>where
C: Unpin,
impl<const N: usize, C> UnsafeUnpin for Array<N, C>where
C: UnsafeUnpin,
impl<const N: usize, C> UnwindSafe for Array<N, C>where
C: UnwindSafe,
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§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<C> NonAmbiguous for Cwhere
C: SPRoundTrip,
impl<C> NonAmbiguous for Cwhere
C: SPRoundTrip,
Source§open spec fn nonamb_inv(&self) -> bool
open spec fn nonamb_inv(&self) -> bool
{ self.sp_roundtrip_inv() }Source§proof fn lemma_serialize_injective(
&self,
v1: <C as Consistency>::Val,
v2: <C as Consistency>::Val,
)
proof fn lemma_serialize_injective( &self, v1: <C as Consistency>::Val, v2: <C as Consistency>::Val, )
Source§impl<C> PSRoundTrip for C
impl<C> PSRoundTrip for C
Source§open spec fn ps_roundtrip_inv(&self) -> bool
open spec fn ps_roundtrip_inv(&self) -> bool
{ self.safe_inv() && self.sound_inv() && self.nonmal_inv() && self.sp_roundtrip_inv() }Source§proof fn theorem_parse_serialize_roundtrip(&self, ibuf: Seq<u8>)
proof fn theorem_parse_serialize_roundtrip(&self, ibuf: Seq<u8>)
Source§impl<C> SPRoundTrip for C
impl<C> SPRoundTrip for C
Source§open spec fn sp_roundtrip_inv(&self) -> bool
open spec fn sp_roundtrip_inv(&self) -> bool
{ self.serialize_inv() && self.equiv_inv() && self.unambiguous() }