Struct Optional 

pub struct Optional<A, B>(pub A, pub B);

Optional field with an arbitrary continuation, defined as Pair(Opt<A>, B).

Unambiguity

Requires disjoint_domains(A, B).

Tuple Fields

0: A

1: B

Trait Implementations

impl<A, B, TA, TB> ByteLen<(Option<TA>, TB)> for Optional<A, B>

where TA: DeepView, TB: DeepView, A: ByteLen<TA>, B: ByteLen<TB>,

open spec fn exec_inv(&self) -> bool

{
    &&& self.0.exec_inv()
    &&& self.1.exec_inv()

}

exec fn length(&self, v: &(Option<TA>, TB)) -> len : usize

impl<A: Clone, B: Clone> Clone for Optional<A, B>

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

ensures

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

call_ensures(B::clone, (&self.1,), cloned.1),

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

Performs copy-assignment from source.

impl<A, B> Consistency for Optional<A, B>

where A: Consistency, B: Consistency,

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

{ Pair(super::Opt(self.0), self.1).consistent(v) }

type Val = (Option<<A as Consistency>::Val>, <B as Consistency>::Val)

The type of values whose consistency is being checked.

impl<A, B, TA, TB> DerOrd<(Option<TA>, TB)> for Optional<A, B>

where TA: DeepView, TB: DeepView, A: DerOrd<TA>, B: DerOrd<TB>,

proof fn lemma_der_serialize_len(&self, value: (Option<TA::V>, TB::V))

open spec fn der_remaining( &self, value: (Option<TA::V>, TB::V), state: PairDerState<OptDerState<A::State>, B::State>, ) -> Seq<u8>

{
    if state.in_left {
        (match (&value.0, &state.left) {
            (Some(value), OptDerState::Some(inner)) => {
                self.0.der_remaining(*value, *inner)
            }
            (None, OptDerState::None) => Seq::empty(),
            _ => Seq::empty(),
        }) + self.1.der_remaining(value.1, state.right)
    } else {
        self.1.der_remaining(value.1, state.right)
    }
}

open spec fn der_state_valid( &self, value: (Option<TA::V>, TB::V), state: PairDerState<OptDerState<A::State>, B::State>, ) -> bool

{
    &&& match (&value.0, &state.left) {
        (Some(value), OptDerState::Some(inner)) => self.0.der_state_valid(*value, *inner),
        (None, OptDerState::None) => true,
        _ => false,
    }
    &&& self.1.der_state_valid(value.1, state.right)
    &&& !state.in_left
        ==> {
            match (&value.0, &state.left) {
                (Some(value), OptDerState::Some(inner)) => {
                    self.0.der_remaining(*value, *inner).len() == 0
                }
                (None, OptDerState::None) => true,
                _ => false,
            }
        }

}

exec fn der_start( &self, o: &(Option<TA>, TB), ) -> state : PairDerState<OptDerState<A::State>, B::State>

exec fn der_next( &self, o: &(Option<TA>, TB), state: &mut PairDerState<OptDerState<A::State>, B::State>, ) -> next : Option<u8>

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

impl<A: DerState, B: DerState> DerState for Optional<A, B>

type State = PairDerState<OptDerState<<A as DerState>::State>, <B as DerState>::State>

impl<A: EquivSerializersGeneral, B: EquivSerializers> EquivSerializers for Optional<A, B>

open spec fn equiv_inv(&self) -> bool

{
    &&& self.0.equiv_general_inv()
    &&& self.1.equiv_inv()

}

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

impl<A: EquivSerializersGeneral, B: EquivSerializersGeneral> EquivSerializersGeneral for Optional<A, B>

open spec fn equiv_general_inv(&self) -> bool

{
    &&& self.0.equiv_general_inv()
    &&& self.1.equiv_general_inv()

}

proof fn lemma_serialize_equiv(&self, v: Self::SVal, obuf: Seq<u8>)

impl<A: GoodSerializer, B: GoodSerializer> GoodSerializer for Optional<A, B>

open spec fn serialize_inv(&self) -> bool

{
    &&& self.0.serialize_inv()
    &&& self.1.serialize_inv()

}

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

impl<Field: HasAsn1Start, Rest: HasAsn1Start> HasAsn1Start for Optional<Field, Rest>

An optional field starts with either the present field or its continuation.

open spec fn asn1_start(&self) -> Asn1StartDomain

{ asn1_start_union(self.0.asn1_start(), self.1.asn1_start()) }

proof fn lemma_parse_implies_asn1_start(&self, input: Seq<u8>)

impl<A: MinMaxByteLen, B: MinMaxByteLen> MinMaxByteLen for Optional<A, B>

open spec fn min(&self) -> nat

{ Pair(super::Opt(self.0), self.1).min() }

open spec fn max(&self) -> nat

{ Pair(super::Opt(self.0), self.1).max() }

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

impl<A: NoLookAhead, B: NoLookAhead> NoLookAhead for Optional<A, B>

open spec fn no_lookahead_inv(&self) -> bool

{
    &&& self.0.no_lookahead_inv()
    &&& self.1.no_lookahead_inv()
    &&& disjoint_domains(self.0, self.1)

}

proof fn lemma_no_lookahead(&self, i1: Seq<u8>, i2: Seq<u8>)

fn corollary_non_extensible(&self, i1: Seq<u8>, i2: Seq<u8>)

impl<A: NonMalleable, B: NonMalleable> NonMalleable for Optional<A, B>

open spec fn nonmal_inv(&self) -> bool

{ Pair(super::Opt(self.0), self.1).nonmal_inv() }

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

impl<A: NonTailFmt, B: NonTailFmt> NonTailFmt for Optional<A, B>

open spec fn serialize_dps_inv(&self) -> bool

{
    &&& self.0.serialize_dps_inv()
    &&& self.1.serialize_dps_inv()

}

proof fn lemma_serialize_dps_prepend(&self, v: Self::SValue, obuf: Seq<u8>)

proof fn lemma_serialize_dps_len(&self, v: Self::SValue, obuf: Seq<u8>)

impl<I, A, B> Parser<I> for Optional<A, B>

where I: InputBuf, A: Parser<I> + SafeParser, B: Parser<I> + SafeParser,

open spec fn exec_inv(&self) -> bool

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

}

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

type PT = (Option<<A as Parser<I>>::PT>, <B as Parser<I>>::PT)

Executable value returned by this parser.

impl<A, B, TA, TB> Prepare<(Option<TA>, TB)> for Optional<A, B>

where TA: DeepView, TB: DeepView, A: Prepare<TA>, B: Prepare<TB>,

open spec fn exec_inv(&self) -> bool

{
    &&& self.0.exec_inv()
    &&& self.1.exec_inv()

}

exec fn prepare(&self, v: &(Option<TA>, TB)) -> Result<usize, PreSerializeError>

impl<A: Productive, B: Productive> Productive for Optional<A, B>

open spec fn productive_inv(&self) -> bool

{ self.1.productive_inv() }

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

impl<A: SPRoundTripDps + NonTailFmt, B: SPRoundTripDps> SPRoundTripDps for Optional<A, B>

open spec fn unambiguous(&self) -> bool

{
    &&& self.0.serialize_dps_inv()
    &&& self.0.unambiguous()
    &&& self.1.unambiguous()
    &&& disjoint_domains(self.0, self.1)

}

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

impl<A, B> SafeParser for Optional<A, B>

where A: SafeParser, B: SafeParser,

open spec fn safe_inv(&self) -> bool

{
    &&& self.0.safe_inv()
    &&& self.1.safe_inv()

}

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

impl<Output: OutputBuf, A, B, TA, TB> Serializer<Output, (Option<TA>, TB)> for Optional<A, B>

where TA: DeepView, TB: DeepView, A: Serializer<Output, TA>, B: Serializer<Output, TB>,

open spec fn exec_inv(&self) -> bool

{
    &&& self.0.exec_inv()
    &&& self.1.exec_inv()

}

exec fn serialize_into(&self, v: &(Option<TA>, TB), obuf: &mut Output)

impl<A, B> SoundParser for Optional<A, B>

where A: SoundParser, B: SoundParser,

open spec fn sound_inv(&self) -> bool

{
    &&& self.0.sound_inv()
    &&& self.1.sound_inv()

}

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

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

impl<A: SpecByteLen, B: SpecByteLen> SpecByteLen for Optional<A, B>

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

{ Pair(super::Opt(self.0), self.1).byte_len(v) }

type T = (Option<<A as SpecByteLen>::T>, <B as SpecByteLen>::T)

The type of values whose byte length is being computed.

impl<A: SpecParser, B: SpecParser> SpecParser for Optional<A, B>

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

{ Pair(super::Opt(self.0), self.1).spec_parse(ibuf) }

type PVal = (Option<<A as SpecParser>::PVal>, <B as SpecParser>::PVal)

The type of parsed values.

impl<A: SpecSerializer, B: SpecSerializer> SpecSerializer for Optional<A, B>

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

{ Pair(super::Opt(self.0), self.1).spec_serialize(v) }

type SVal = (Option<<A as SpecSerializer>::SVal>, <B as SpecSerializer>::SVal)

The type of values to be serialized.

impl<A: SpecSerializerDps, B: SpecSerializerDps> SpecSerializerDps for Optional<A, B>

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

{ Pair(super::Opt(self.0), self.1).spec_serialize_dps(v, obuf) }

type SValue = (Option<<A as SpecSerializerDps>::SValue>, <B as SpecSerializerDps>::SValue)

The type of values to be serialized.

impl<A: ValueByteLen, B: ValueByteLen> ValueByteLen for Optional<A, B>

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

{ <Pair<super::Opt<A>, B> as ValueByteLen>::value_byte_len(v) }

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

impl<A: Copy, B: Copy> Copy for Optional<A, B>