Struct Period 

pub struct Period {
    pub period: f64,
    pub critical_cycle: Vec<usize>,
    pub cyclic: bool,
    pub live: bool,
}

The steady-state period of a marked graph, with the cycle that attains it.

Fields

period: f64

Cycles per steady-state iteration — the spatial clock.

critical_cycle: Vec<usize>

The transitions of a cycle attaining the maximum, in order. Empty when the graph is acyclic, which means the program has no steady state to speak of: it runs once and drains.

cyclic: bool

Whether any directed cycle exists at all.

live: bool

False when some directed cycle carries NO token. Such a cycle can never fire — it is a deadlock, and it is exactly what Commoner’s condition forbids — so the period is infinite rather than large. Reporting a big finite number there would hand a caller a schedule that cannot run.

Trait Implementations

impl Clone for Period

fn clone(&self) -> Period

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Period

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

Formats the value using the given formatter.

impl PartialEq for Period

fn eq(&self, other: &Period) -> 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 StructuralPartialEq for Period