Struct TailWord 

pub struct TailWord {
    pub real: u32,
    pub mid: Vec<bool>,
    pub tail_top: bool,
}

A finite trace completed with a constant tail, the infinite words Annex F’s satisfaction relations are defined over (F.5.3.2): w followed by ⊤^ω is the WEAK verdict word (nothing has failed yet), w followed by ⊥^ω the STRONG one (everything still owed has failed). A letter ⊤ satisfies every Boolean expression, a letter ⊥ none – not even 1'b1 (F.5.3).

Ticks 0..real are the trace’s real samples (a leaf is evaluated there); then come the explicit mid letters (true is ⊤), then tail_top forever. mid exists because a ⊥-tailed word cut at a later tick and completed with ⊤ (w^{0,i-1}⊤^ω, accept_on/weak) has a run of ⊥ letters before its ⊤ tail.

Fields

real: u32

mid: Vec<bool>

tail_top: bool

Implementations

impl TailWord

pub fn weak(real: u32) -> Self

w⊤^ω over real real samples: the weak verdict word.

pub fn strong(real: u32) -> Self

w⊥^ω over real real samples: the strong verdict word.

pub fn extent(&self) -> u32

The first tick whose letter is the constant tail: every later tick looks the same, so a property cannot tell tick extent() from any tick after.

pub fn letter(&self, tick: u32) -> Option<bool>

Some(true) for a ⊤ letter, Some(false) for ⊥, None for a real sample at tick.

pub fn flip(&self) -> Self

The dual word w̄ (F.5.3.1: w ⊨ not P iff w̄ ⊭ P): every ⊤ letter becomes ⊥ and vice versa. The real samples are untouched.

pub fn cut_then_top(&self, n: u32) -> Self

w^{0,n-1}⊤^ω: the first n letters, then ⊤ forever (the word weak(R) and accept_on complete a prefix with, F.5.3.1).

Trait Implementations

impl Clone for TailWord

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TailWord

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for TailWord

impl Hash for TailWord

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for TailWord

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for TailWord