Struct ReduceWindow 

pub struct ReduceWindow<T, RIn, ROut, K = u64, VIn = u64, VOut = u64> {
    pub input: ProxyBridge<T, RIn, K, VIn>,
    pub seeds: Vec<(K, T)>,
    pub output: ProxyBridge<T, ROut, K, VOut>,
}

One window of the key space: the presentations a bounded, key-contiguous snip needs.

Seeds travel as times; records travel netted. The novel data’s two roles are carried by two different channels: its TIME SUPPORT seeds interesting times and rides seeds, raw; its RECORDS are mere accumulants and join partners, so they ride input merged with the prior history, where they may net against it and be advanced like anything else. Consolidation can only cancel equal-((key, id), time) pairs, and such a time is necessarily in seeds, so no interesting time is lost to netting — the invariant that once forced the runs apart.

Owned by the harness and refilled by ProxyReduceBackend::next_window.

Fields

input: ProxyBridge<T, RIn, K, VIn>

The key’s full input — novel and prior merged, netted — sorted & consolidated by ((key, value_id), time). May be advanced to the compaction frontier.

seeds: Vec<(K, T)>

The RAW novel time support: (key, time) pairs sorted by (key, time) and deduplicated. Record these from the novel batches BEFORE any consolidation or advancement. A netted-away record’s time must still appear here.

output: ProxyBridge<T, ROut, K, VOut>

Accumulated output preceding the retire’s interval, same ordering as input.

Implementations

impl<T, RIn, ROut, K, VIn, VOut> ReduceWindow<T, RIn, ROut, K, VIn, VOut>

pub fn clear(&mut self)

Clear the presentations, keeping their allocations.

Trait Implementations

impl<T, RIn, ROut, K, VIn, VOut> Default for ReduceWindow<T, RIn, ROut, K, VIn, VOut>

fn default() -> Self

Returns the “default value” for a type.