pub struct Armed<N>(/* private fields */)
where
N: Episodic,
<N as Cell>::Out<'t>: for<'t> Episode;Expand description
An Episodic node’s own contact, sealed in: an ordinary node stepped before N, so N and any
leg meant to go dark with it name it in a Gating dep. It folds its trigger at
Horizon::Unbounded by construction — a latched bit is exactly the state nothing reconstitutes
— which is also why it can never itself be gated.
Episodic’s where is repeated on every impl below: a trait’s where-clause is an obligation at
each use of the bound, not an implied one, and Latch needs exactly it to accept Cut = N.
Trait Implementations§
Source§impl<N> Blind for Armed<N>
impl<N> Blind for Armed<N>
Source§const WHY: &'static str = "a latch is a bit that stays set: `arms` is a predicate over an episode, not a value with a slope"
const WHY: &'static str = "a latch is a bit that stays set: `arms` is a predicate over an episode, not a value with a slope"
Why this node has no formula. Written for whoever asks why it is not
Symbolic.fn advance<'t>( &'t mut self, _: <<Armed<N> as Wired>::Deps as DepSet>::Outs<'t>, ) -> <Armed<N> as Cell>::Out<'t>
Source§impl<N> Cell for Armed<N>
impl<N> Cell for Armed<N>
Source§const NAME: &'static str
const NAME: &'static str
What this cell is called wherever a human reads the graph — cards, edges,
step_until.
Defaults to the Rust path, which is right for a type whose identity is its name. A cell
carrying parameters overrides it through Tag, because type_name renders those the
compiler’s way and the rest of the graph spells the same cells its own.type Out<'t> = bool
Source§const REACH: Horizon = Horizon::Unit
const REACH: Horizon = Horizon::Unit
How far back a consumer naming this in dep position reads. A bare cell is this tick’s batch
and nothing more; the wrappers (
Buffering, Folding) are what state anything else. This
lives on Cell rather than a Dep trait because DepSet is implemented over tuples of
cells, and a blanket impl<C: Cell> Dep for C would conflict with the wrapper impls.Source§const CLOCK: Option<Timeframe> = None
const CLOCK: Option<Timeframe> = None
How often this cell publishes, for a root and for a node whose kernel changes its input’s rate
(
rates.node.declared). None — whenever its inputs do. Some(tf) — over elements whose tf
period has closed, never re-entered while one is in progress (rates.node.whole-elements). Read moreimpl<N> Gate for Armed<N>
Auto Trait Implementations§
impl<N> Forget for Armed<N>
impl<N> Freeze for Armed<N>
impl<N> RefUnwindSafe for Armed<N>
impl<N> Send for Armed<N>
impl<N> Sync for Armed<N>
impl<N> Unpin for Armed<N>
impl<N> UnsafeUnpin for Armed<N>
impl<N> UnwindSafe for Armed<N>
Blanket Implementations§
impl<T> Allocation for T
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more