Struct TripCase 

pub struct TripCase {
    pub counts: Vec<usize>,
    pub places: usize,
    pub transitions: usize,
    pub digest: u64,
    pub witness: usize,
}

★ ONE COUNT OF A TRIP, PROVED. The graph a part of the program unrolls to when each trip it runs to counts counts[i] (its trips in id order), carried like a section’s: its shape, its digest, and the witness-table entry that orders it. recheck rebuilds every one.

Fields

counts: Vec<usize>

places: usize

transitions: usize

digest: u64

witness: usize

Trait Implementations

impl Clone for TripCase

fn clone(&self) -> TripCase

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TripCase

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for TripCase

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for TripCase

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for TripCase

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for TripCase

impl StructuralPartialEq for TripCase