Struct RepeatTillEnd 

pub struct RepeatTillEnd<C>(pub C);

Sugar for Repeat(C, Eof).

Tuple Fields

0: C

Trait Implementations

impl<A, T> ByteLen<&[T]> for RepeatTillEnd<A>

where A: ByteLen<T> + Copy, T: DeepView,

open spec fn exec_inv(&self) -> bool

{ self.0.exec_inv() }

exec fn length(&self, v: &&[T]) -> len : usize

impl<A, T> ByteLen<Vec<T>> for RepeatTillEnd<A>

where A: ByteLen<T> + Copy, T: DeepView,

Available on crate feature alloc only.

open spec fn exec_inv(&self) -> bool

{ self.0.exec_inv() }

exec fn length(&self, v: &Vec<T>) -> len : usize

impl<C: Clone> Clone for RepeatTillEnd<C>

exec fn clone(&self) -> cloned : Self

ensures

call_ensures(C::clone, (&self.0,), cloned.0),

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

Performs copy-assignment from source.

impl<C> Consistency for RepeatTillEnd<C>

where C: Consistency,

open spec fn consistent(&self, v: Self::Val) -> bool

{ Repeat(self.0, super::Eof).consistent((v, ())) }

type Val = Seq<<C as Consistency>::Val>

The type of values whose consistency is being checked.

impl<A, T> DerOrd<Vec<T>> for RepeatTillEnd<A>

where T: DeepView, A: DerOrd<T> + Copy,

Available on crate feature alloc only.

proof fn lemma_der_serialize_len(&self, values: Seq<T::V>)

open spec fn der_remaining( &self, values: Seq<T::V>, state: StarDerState<A::State>, ) -> Seq<u8>

{ Star(self.0).der_remaining(values, state) }

open spec fn der_state_valid( &self, values: Seq<T::V>, state: StarDerState<A::State>, ) -> bool

{ Star(self.0).der_state_valid(values, state) }

exec fn der_start(&self, v: &Vec<T>) -> state : StarDerState<A::State>

exec fn der_next(&self, v: &Vec<T>, state: &mut StarDerState<A::State>) -> next : Option<u8>

fn der_leq(&self, left: &T, right: &T) -> bool

impl<A: DerState> DerState for RepeatTillEnd<A>

Available on crate feature alloc only.

type State = StarDerState<<A as DerState>::State>

impl<C: EquivSerializersGeneral> EquivSerializers for RepeatTillEnd<C>

open spec fn equiv_inv(&self) -> bool

{ self.0.equiv_general_inv() }

proof fn lemma_serialize_equiv_on_empty(&self, v: Self::SVal)

impl<C: GoodSerializer> GoodSerializer for RepeatTillEnd<C>

open spec fn serialize_inv(&self) -> bool

{ self.0.serialize_inv() }

proof fn lemma_serialize_len(&self, v: Self::SVal)

impl<C: NonMalleable + SafeParser> NonMalleable for RepeatTillEnd<C>

open spec fn nonmal_inv(&self) -> bool

{ Repeat(self.0, super::Eof).nonmal_inv() }

proof fn lemma_parse_non_malleable(&self, buf1: Seq<u8>, buf2: Seq<u8>)

impl<I, A> Parser<I> for RepeatTillEnd<A>

where I: InputBuf, A: Parser<I> + SafeParser + Productive + Copy,

Available on crate feature alloc only.

open spec fn exec_inv(&self) -> bool

{
    &&& self.0.exec_inv()
    &&& self.0.safe_inv()
    &&& self.0.productive_inv()

}

exec fn parse(&self, ibuf: &I) -> r : PResult<Self::PT>

type PT = Vec<<A as Parser<I>>::PT>

Executable value returned by this parser.

impl<A, T> Prepare<&[T]> for RepeatTillEnd<A>

where A: Prepare<T> + Copy, T: DeepView,

open spec fn exec_inv(&self) -> bool

{ self.0.exec_inv() }

exec fn prepare(&self, v: &&[T]) -> Result<usize, PreSerializeError>

impl<A, T> Prepare<Vec<T>> for RepeatTillEnd<A>

where A: Prepare<T> + Copy, T: DeepView,

Available on crate feature alloc only.

open spec fn exec_inv(&self) -> bool

{ self.0.exec_inv() }

exec fn prepare(&self, v: &Vec<T>) -> Result<usize, PreSerializeError>

impl<C: SafeParser> Productive for RepeatTillEnd<C>

open spec fn productive_inv(&self) -> bool

{ false }

proof fn lemma_productive(&self, s: Seq<u8>)

impl<C: SPRoundTripDps + NonTailFmt + Productive> SPRoundTripDps for RepeatTillEnd<C>

open spec fn unambiguous(&self) -> bool

{
    &&& self.0.serialize_dps_inv()
    &&& self.0.unambiguous()
    &&& self.0.safe_inv()
    &&& self.0.productive_inv()

}

proof fn theorem_serialize_dps_parse_roundtrip(&self, v: Self::T, obuf: Seq<u8>)

impl<C> SafeParser for RepeatTillEnd<C>

where C: SafeParser,

open spec fn safe_inv(&self) -> bool

{ self.0.safe_inv() }

proof fn lemma_parse_safe(&self, ibuf: Seq<u8>)

impl<Output: OutputBuf, A, T> Serializer<Output, &[T]> for RepeatTillEnd<A>

where A: Serializer<Output, T> + Copy, T: DeepView,

open spec fn exec_inv(&self) -> bool

{ self.0.exec_inv() }

exec fn serialize_into(&self, v: &&[T], obuf: &mut Output)

impl<Output: OutputBuf, A, T> Serializer<Output, Vec<T>> for RepeatTillEnd<A>

where A: Serializer<Output, T> + Copy, T: DeepView,

Available on crate feature alloc only.

open spec fn exec_inv(&self) -> bool

{ self.0.exec_inv() }

exec fn serialize_into(&self, v: &Vec<T>, obuf: &mut Output)

impl<C> SoundParser for RepeatTillEnd<C>

where C: SoundParser,

open spec fn sound_inv(&self) -> bool

{ self.0.sound_inv() }

proof fn lemma_parse_sound_consumption(&self, ibuf: Seq<u8>)

proof fn lemma_parse_sound_value(&self, ibuf: Seq<u8>)

impl<C: SpecByteLen> SpecByteLen for RepeatTillEnd<C>

open spec fn byte_len(&self, v: Self::T) -> nat

{ Repeat(self.0, super::Eof).byte_len((v, ())) }

type T = Seq<<C as SpecByteLen>::T>

The type of values whose byte length is being computed.

impl<C: SpecParser> SpecParser for RepeatTillEnd<C>

open spec fn spec_parse(&self, ibuf: Seq<u8>) -> Option<(int, Self::PVal)>

{
    match Repeat(self.0, super::Eof).spec_parse(ibuf) {
        Some((n, (vs, _))) => Some((n, vs)),
        None => None,
    }
}

type PVal = Seq<<C as SpecParser>::PVal>

The type of parsed values.

impl<C: SpecSerializer> SpecSerializer for RepeatTillEnd<C>

open spec fn spec_serialize(&self, v: Self::SVal) -> Seq<u8>

{ Repeat(self.0, super::Eof).spec_serialize((v, ())) }

type SVal = Seq<<C as SpecSerializer>::SVal>

The type of values to be serialized.

impl<C: SpecSerializerDps> SpecSerializerDps for RepeatTillEnd<C>

open spec fn spec_serialize_dps(&self, v: Self::SValue, obuf: Seq<u8>) -> Seq<u8>

{ Repeat(self.0, super::Eof).spec_serialize_dps((v, ()), obuf) }

type SValue = Seq<<C as SpecSerializerDps>::SValue>

The type of values to be serialized.

impl<C: ValueByteLen> ValueByteLen for RepeatTillEnd<C>

open spec fn value_byte_len(v: Self::T) -> nat

{ <Repeat<C, super::Eof> as ValueByteLen>::value_byte_len((v, ())) }

proof fn lemma_value_len_matches_byte_len(&self, v: Self::T)

impl<C: Copy> Copy for RepeatTillEnd<C>