pub struct Cond<Inner> {
pub cond: bool,
pub inner: Inner,
}Expand description
Combinator that checks if cond is true and then delegates to the inner combinator.
Fields§
§cond: boolThe condition to check before parsing or serializing.
inner: InnerThe combinator to delegate to if cond is true.
Trait Implementations§
Source§impl<'x, I: VestInput, O: VestOutput<I>, Inner: Combinator<'x, I, O>> Combinator<'x, I, O> for Cond<Inner>where
Inner::V: SecureSpecCombinator<Type = <Inner::Type as View>::V>,
impl<'x, I: VestInput, O: VestOutput<I>, Inner: Combinator<'x, I, O>> Combinator<'x, I, O> for Cond<Inner>where
Inner::V: SecureSpecCombinator<Type = <Inner::Type as View>::V>,
Source§open spec fn ex_requires(&self) -> bool
open spec fn ex_requires(&self) -> bool
{ self.inner.ex_requires() }Source§exec fn serialize(
&self,
v: Self::SType,
data: &mut O,
pos: usize,
) -> Result<usize, SerializeError>
exec fn serialize( &self, v: Self::SType, data: &mut O, pos: usize, ) -> Result<usize, SerializeError>
Source§type Type = <Inner as Combinator<'x, I, O>>::Type
type Type = <Inner as Combinator<'x, I, O>>::Type
The result type of parsing
Source§type SType = <Inner as Combinator<'x, I, O>>::SType
type SType = <Inner as Combinator<'x, I, O>>::SType
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§impl<Inner1, Inner2> DisjointFrom<Cond<Inner2>> for Cond<Inner1>where
Inner1: SpecCombinator,
Inner2: SpecCombinator,
impl<Inner1, Inner2> DisjointFrom<Cond<Inner2>> for Cond<Inner1>where
Inner1: SpecCombinator,
Inner2: SpecCombinator,
Source§open spec fn disjoint_from(&self, other: &Cond<Inner2>) -> bool
open spec fn disjoint_from(&self, other: &Cond<Inner2>) -> bool
{ self.cond ==> !other.cond }Source§proof fn parse_disjoint_on(&self, other: &Cond<Inner2>, buf: Seq<u8>)
proof fn parse_disjoint_on(&self, other: &Cond<Inner2>, buf: Seq<u8>)
Source§impl<Inner: SecureSpecCombinator> SecureSpecCombinator for Cond<Inner>
impl<Inner: SecureSpecCombinator> SecureSpecCombinator for Cond<Inner>
Source§proof fn theorem_serialize_parse_roundtrip(&self, v: Self::Type)
proof fn theorem_serialize_parse_roundtrip(&self, v: Self::Type)
Source§proof fn theorem_parse_serialize_roundtrip(&self, buf: Seq<u8>)
proof fn theorem_parse_serialize_roundtrip(&self, buf: Seq<u8>)
Source§open spec fn is_prefix_secure() -> bool
open spec fn is_prefix_secure() -> bool
{ Inner::is_prefix_secure() }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 lemma_parse_length(&self, s: Seq<u8>)
proof fn lemma_parse_length(&self, s: Seq<u8>)
Source§open spec fn is_productive(&self) -> bool
open spec fn is_productive(&self) -> bool
{ self.inner.is_productive() }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<Inner: SpecCombinator> SpecCombinator for Cond<Inner>
impl<Inner: SpecCombinator> SpecCombinator for Cond<Inner>
Source§open spec fn spec_parse(&self, s: Seq<u8>) -> Option<(int, Self::Type)>
open spec fn spec_parse(&self, s: Seq<u8>) -> Option<(int, Self::Type)>
{ if self.cond { self.inner.spec_parse(s) } else { None } }Source§open spec fn spec_serialize(&self, v: Self::Type) -> Seq<u8>
open spec fn spec_serialize(&self, v: Self::Type) -> Seq<u8>
{ self.inner.spec_serialize(v) }Source§type Type = <Inner as SpecCombinator>::Type
type Type = <Inner as SpecCombinator>::Type
The view of [
Combinator::Result].Auto Trait Implementations§
impl<Inner> Freeze for Cond<Inner>where
Inner: Freeze,
impl<Inner> RefUnwindSafe for Cond<Inner>where
Inner: RefUnwindSafe,
impl<Inner> Send for Cond<Inner>where
Inner: Send,
impl<Inner> Sync for Cond<Inner>where
Inner: Sync,
impl<Inner> Unpin for Cond<Inner>where
Inner: Unpin,
impl<Inner> UnwindSafe for Cond<Inner>where
Inner: 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
§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.