Struct Choice 

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

Ordered choice combinator consuming/producing a sum type.

Parsing semantics: tries A first, wrapping success in Sum::Inl; on failure, tries B, wrapping success in Sum::Inr.

Consistency

If a value a is consistent with A, then Sum::Inl(a) is consistent with Choice(A, B). If a value b is consistent with B, then Sum::Inr(b) is consistent with Choice(A, B).

Unambiguity

Requires disjoint_domains(A, B).

Tuple Fields

0: A

1: B

Trait Implementations

impl<A, B, TA, TB> ByteLen<Sum<TA, TB>> for Choice<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: &Sum<TA, TB>) -> len : usize

impl<A: Clone, B: Clone> Clone for Choice<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: Consistency, B: Consistency> Consistency for Choice<A, B>

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

{
    match v {
        Sum::Inl(va) => self.0.consistent(va),
        Sum::Inr(vb) => self.1.consistent(vb),
    }
}

type Val = Sum<<A as Consistency>::Val, <B as Consistency>::Val>

The type of values whose consistency is being checked.

impl<A, B, TA, TB> DerOrd<Sum<TA, TB>> for Choice<A, B>

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

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

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

{
    match (value, state) {
        (Sum::Inl(value), ChoiceDerState::Left(state)) => {
            self.0.der_remaining(value, state)
        }
        (Sum::Inr(value), ChoiceDerState::Right(state)) => {
            self.1.der_remaining(value, state)
        }
        _ => Seq::empty(),
    }
}

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

{
    match (value, state) {
        (Sum::Inl(value), ChoiceDerState::Left(state)) => {
            self.0.der_state_valid(value, state)
        }
        (Sum::Inr(value), ChoiceDerState::Right(state)) => {
            self.1.der_state_valid(value, state)
        }
        _ => false,
    }
}

exec fn der_start(&self, v: &Sum<TA, TB>) -> state : ChoiceDerState<A::State, B::State>

exec fn der_next( &self, v: &Sum<TA, TB>, state: &mut ChoiceDerState<A::State, B::State>, ) -> next : Option<u8>

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

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

type State = ChoiceDerState<<A as DerState>::State, <B as DerState>::State>

impl<A, B> EquivSerializers for Choice<A, B>

where A: EquivSerializers, B: EquivSerializers,

open spec fn equiv_inv(&self) -> bool

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

}

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

impl<A, B> EquivSerializersGeneral for Choice<A, B>

where A: EquivSerializersGeneral, B: EquivSerializersGeneral,

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 Choice<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<Left: HasAsn1Start, Right: HasAsn1Start> HasAsn1Start for Choice<Left, Right>

A structural choice accepts the union of the starts accepted by either branch.

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 Choice<A, B>

open spec fn min(&self) -> nat

{ if self.0.min() <= self.1.min() { self.0.min() } else { self.1.min() } }

open spec fn max(&self) -> nat

{ if self.0.max() <= self.1.max() { self.1.max() } else { self.0.max() } }

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

impl<A: NoLookAhead, B: NoLookAhead> NoLookAhead for Choice<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 Choice<A, B>

open spec fn nonmal_inv(&self) -> bool

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

}

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

impl<A, B> NonTailFmt for Choice<A, B>

where A: NonTailFmt, B: NonTailFmt,

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 Choice<A, B>

where I: View<V = Seq<u8>>, A: Parser<I>, B: Parser<I>,

open spec fn exec_inv(&self) -> bool

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

}

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

type PT = Sum<<A as Parser<I>>::PT, <B as Parser<I>>::PT>

Executable value returned by this parser.

impl<A, B, TA, TB> Prepare<Sum<TA, TB>> for Choice<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: &Sum<TA, TB>) -> checked : Result<usize, PreSerializeError>

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

open spec fn productive_inv(&self) -> bool

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

}

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

impl<A: SPRoundTripDps, B: SPRoundTripDps> SPRoundTripDps for Choice<A, B>

open spec fn unambiguous(&self) -> bool

{
    &&& 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: SafeParser, B: SafeParser> SafeParser for Choice<A, B>

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, Sum<TA, TB>> for Choice<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: &Sum<TA, TB>, obuf: &mut Output)

impl<A: SoundParser, B: SoundParser> SoundParser for Choice<A, B>

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, B> SpecByteLen for Choice<A, B>

where A: SpecByteLen, B: SpecByteLen,

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

{
    match v {
        Sum::Inl(va) => self.0.byte_len(va),
        Sum::Inr(vb) => self.1.byte_len(vb),
    }
}

type T = Sum<<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 Choice<A, B>

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

{
    match self.0.spec_parse(ibuf) {
        Some((n, va)) => Some((n, Sum::Inl(va))),
        None => {
            match self.1.spec_parse(ibuf) {
                Some((n, vb)) => Some((n, Sum::Inr(vb))),
                None => None,
            }
        }
    }
}

type PVal = Sum<<A as SpecParser>::PVal, <B as SpecParser>::PVal>

The type of parsed values.

impl<A, B> SpecSerializer for Choice<A, B>

where A: SpecSerializer, B: SpecSerializer,

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

{
    match v {
        Sum::Inl(va) => self.0.spec_serialize(va),
        Sum::Inr(vb) => self.1.spec_serialize(vb),
    }
}

type SVal = Sum<<A as SpecSerializer>::SVal, <B as SpecSerializer>::SVal>

The type of values to be serialized.

impl<A, B> SpecSerializerDps for Choice<A, B>

where A: SpecSerializerDps, B: SpecSerializerDps,

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

{
    match v {
        Sum::Inl(va) => self.0.spec_serialize_dps(va, obuf),
        Sum::Inr(vb) => self.1.spec_serialize_dps(vb, obuf),
    }
}

type SValue = Sum<<A as SpecSerializerDps>::SValue, <B as SpecSerializerDps>::SValue>

The type of values to be serialized.

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

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

{
    match v {
        Sum::Inl(va) => A::value_byte_len(va),
        Sum::Inr(vb) => B::value_byte_len(vb),
    }
}

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

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