Skip to main content

Schedule

Enum Schedule 

Source
pub enum Schedule {
    OneWay,
    Staggered,
    Iterative {
        max_iter: u32,
        tol: f64,
    },
    Multirate,
}
Expand description

How the domains are interleaved.

Variants§

§

OneWay

One pass in declared order, no feedback expected. Unconditionally stable; the only schedule whose domains could safely run concurrently.

§

Staggered

One pass in declared order, with each domain seeing the previous ones’ output from this step and the later ones’ from the last. Cheap, and stable only while the coupling is weak.

§

Iterative

Repeat the pass until every domain’s residual is under tol, or fail.

The cost is max_iter passes; the benefit is stability where a staggered scheme diverges no matter how small the step. Failing to converge is reported as a Violation rather than accepted, because an unconverged coupling that is allowed through is the most expensive kind of wrong answer: it looks like physics.

Fields

§max_iter: u32

Give up after this many sweeps. Reaching it is a Violation, not a result.

§tol: f64

The residual every domain must fall under for the step to be accepted.

§

Multirate

As Schedule::Staggered, but each evolving domain takes as many equal substeps as its own stability limit needs.

§It does not refine a coupled quantity, and the audit cannot tell you

Read this before choosing it for accuracy, because that is the obvious reason to and it is the wrong one.

One domain is stepped to completion before the next. A quasi-static publisher is never subcycled, so it puts a whole outer step’s worth on the bus once; a subcycling consumer then calls Exchange::take on its first substep and takes all of it. So every joule of the interval is deposited at its beginning and decays for the rest of it, and refining the substep does not move the answer toward the truth. Taking the limit of u ← u·gⁿ + (P·dt/C)·g^(n−1) with g = 1 − h/τ as n → ∞ gives u·e^(−dt/τ) + (P·dt/C)·e^(−dt/τ), which is not the solution: the error is first order in the outer step and independent of the substep entirely.

Measured on a lumped plate under a steady lamp, against the closed form: 26.2% low at a 300 s outer step, 13.8% at 150 s, 7.1% at 75 s — whatever the substep count. At the same outer step it is not reliably better than Schedule::Staggered and at a coarse one it is worse, with the errors on opposite sides.

Every one of those runs passes the conservation audit at around 1e-12. The total that crossed is exactly right; only its distribution in time is wrong, and a Ledger has no representation for when. This is the time-domain twin of the reason Exchange::audit_transfers had to become a per-face check in space — a quantity moved to the wrong part of an interval keeps its total, and conservation is blind to it.

So: choose this for stability, which is what it delivers — a domain whose limit is a hundredth of the frame no longer forces the frame to shrink. Choose the outer step for accuracy, because that is what sets it. crates/dualis/tests/multirate_timing.rs pins the consequence.

Trait Implementations§

Source§

impl Clone for Schedule

Source§

fn clone(&self) -> Schedule

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Copy for Schedule

Source§

impl Debug for Schedule

Source§

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

Formats the value using the given formatter. Read more
Source§

impl PartialEq for Schedule

Source§

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

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

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

Inequality operator !=. Read more
Source§

impl StructuralPartialEq for Schedule

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.