pub struct Polls {
pub entries: Vec<PollEntry>,
}Expand description
The poll(…) entries: a node’s own clocks, entry by entry.
DECLARATION ORDER IS THE CONTRACT. A poll source is a POSITION in the runtime’s schedule, and
the position an entry lands at is the order it was written in — so the emitted <Node>Due
translates one into the other and an author never counts.
Fields§
§entries: Vec<PollEntry>The entries, in declaration order.
Implementations§
Source§impl Polls
impl Polls
Sourcepub fn granting(&self) -> impl Iterator<Item = (usize, &PollEntry)>
pub fn granting(&self) -> impl Iterator<Item = (usize, &PollEntry)>
The entries that GRANT, each with its POSITION IN THE WHOLE SCHEDULE, in declaration order.
The position is the schedule’s and not the granting subset’s, because that is what a tick
carries: PollUpstream is a position among ALL of a node’s clocks, so a route keyed on anything
else would send a granting clock’s tick to the wrong entry the day an ungranted clock is
declared before it.
Written once and read from both the collision table and the emitter, because the two must agree entry for entry: a name registered for a clock the emitter skips would refuse a declaration for a clash no expansion can make.
Sourcepub fn sweeping(&self) -> impl Iterator<Item = (usize, &PollEntry)>
pub fn sweeping(&self) -> impl Iterator<Item = (usize, &PollEntry)>
The entries that are <Node>Sweeps METHODS — the ones that wrote light — each with its
position in the whole schedule, in declaration order.
granting’s sibling over the other axis, and the PRESENCE SPLIT is read off
it: an empty answer is a node whose every clock runs a mounted body, which emits no sweep trait
at all. Written once and read from the collision table and the emitter for granting’s reason
— a name registered for a trait the emitter skips would refuse a declaration for a clash no
expansion can make.