Function threshold_arrangement

fn threshold_arrangement<G, T1, Bu2, T2, L>(
    arrangement: &Arranged<G, T1>,
    name: &str,
    logic: L,
) -> Arranged<G, TraceAgent<T2>>
where
    G: Scope,
    G::Timestamp: MzTimestamp,
    T1: TraceReader<KeyOwn: MzData + Data, ValOwn: MzData + Data, Time = G::Timestamp, Diff = Diff> + Clone + 'static,
    Bu2: Builder<Time = G::Timestamp, Input: Container + MergerChunk + PushInto<((T1::KeyOwn, T1::ValOwn), G::Timestamp, Diff)>, Output = T2::Batch>,
    T2: for<'a> Trace<Key<'a> = T1::Key<'a>, Val<'a> = T1::Val<'a>, KeyOwn = T1::KeyOwn, ValOwn = T1::ValOwn, Time = G::Timestamp, Diff = Diff> + 'static,
    L: Fn(&Diff) -> bool + 'static,
    Arranged<G, TraceAgent<T2>>: ArrangementSize,

Shared function to compute an arrangement of values matching logic.