
Streams a value-exact subset of any t stream out as bare t, only on the ticks a firing policy selects, so a costly downstream stage runs at a reduced rate. Each fire emits its read window as that many ordered t messages: an omega fan-out, never a list.
A high-FPS frame stream is decimated to one frame in every stride before an expensive detector, so the detector computes on a fraction of the arrivals and the forwarded frame feeds the rest of the graph unchanged as a bare value.
A bursty value stream is throttled to a wall-clock interval and each fire flushes everything buffered since the previous fire as separate messages, so no skipped value is lost yet the sink sees a paced stream.
t messages on out_0, in arrival order; a fire whose window is empty (a degenerate window_skip slice, or take since_last with nothing new buffered) emits zero messages, which is the intended fan-out, not a stall.take window, which re-streams them on the next fire; under the newest, last, and window windows the skipped values are lost.take_size, window_step, and window_skip only affect the last and window read windows; the newest and since_last windows ignore them.Automated release