Struct HiddenWake

pub struct HiddenWake {
    pub free_share: f64,
    pub once_share: f64,
}

How a hidden law may be woken on this event, by whichever source offers the most (design §3.3: the largest available multiplier, never the sum).

Two numbers rather than one because the strongest source may be spent: HL-04 Single Lesson offers 100% but only once per phase, and once its latch is taken the law must fall back to whatever is still free rather than stop waking. The caller claims the latch only when it actually uses once_share.

Fields

free_share: f64

Largest share offered by a source with no per-phase limit.

once_share: f64

Share offered by HL-04, or 0.0 when it is not offering one here.

Implementations

impl HiddenWake

pub fn is_silent(&self) -> bool

Trait Implementations

impl Clone for HiddenWake

fn clone(&self) -> HiddenWake

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for HiddenWake

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

Formats the value using the given formatter.

impl Default for HiddenWake

fn default() -> HiddenWake

Returns the “default value” for a type.

impl PartialEq for HiddenWake

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

impl StructuralPartialEq for HiddenWake