Enum dataflow::render::context::ArrangementFlavor

pub enum ArrangementFlavor<S: Scope, V: Data, T: Lattice> where
    T: Timestamp + Lattice,
    S::Timestamp: Lattice + Refines<T>,  {
    Local(Arranged<S, TraceAgent<OrdValSpine<V, V, <S as ScopeParent>::Timestamp, Diff, usize>>>, Arranged<S, TraceAgent<OrdKeySpine<DataflowError, <S as ScopeParent>::Timestamp, Diff, usize>>>),
    Trace(GlobalId, Arranged<S, TraceEnter<TraceFrontier<TraceAgent<OrdValSpine<V, V, T, Diff, usize>>>, <S as ScopeParent>::Timestamp>>, Arranged<S, TraceEnter<TraceFrontier<TraceAgent<OrdKeySpine<DataflowError, T, Diff, usize>>>, <S as ScopeParent>::Timestamp>>),
}

Describes flavor of arrangement: local or imported trace.

Variants

Local(Arranged<S, TraceAgent<OrdValSpine<V, V, <S as ScopeParent>::Timestamp, Diff, usize>>>, Arranged<S, TraceAgent<OrdKeySpine<DataflowError, <S as ScopeParent>::Timestamp, Diff, usize>>>)

Tuple Fields

0: Arranged<S, TraceAgent<OrdValSpine<V, V, <S as ScopeParent>::Timestamp, Diff, usize>>>

1: Arranged<S, TraceAgent<OrdKeySpine<DataflowError, <S as ScopeParent>::Timestamp, Diff, usize>>>

A dataflow-local arrangement.

Trace(GlobalId, Arranged<S, TraceEnter<TraceFrontier<TraceAgent<OrdValSpine<V, V, T, Diff, usize>>>, <S as ScopeParent>::Timestamp>>, Arranged<S, TraceEnter<TraceFrontier<TraceAgent<OrdKeySpine<DataflowError, T, Diff, usize>>>, <S as ScopeParent>::Timestamp>>)

Tuple Fields

0: GlobalId

1: Arranged<S, TraceEnter<TraceFrontier<TraceAgent<OrdValSpine<V, V, T, Diff, usize>>>, <S as ScopeParent>::Timestamp>>

2: Arranged<S, TraceEnter<TraceFrontier<TraceAgent<OrdKeySpine<DataflowError, T, Diff, usize>>>, <S as ScopeParent>::Timestamp>>

An imported trace from outside the dataflow.

The GlobalId identifier exists so that exports of this same trace can refer back to and depend on the original instance.

Implementations

impl<S: Scope, T> ArrangementFlavor<S, Row, T> where
    T: Timestamp + Lattice,
    S::Timestamp: Lattice + Refines<T>, 

pub fn as_collection(
    &self
) -> (Collection<S, Row, Diff>, Collection<S, DataflowError, Diff>)

Presents self as a stream of updates.

This method presents the contents as they are, without further computation. If you have logic that could be applied to each record, consider using the flat_map methods which allows this and can reduce the work done.

pub fn flat_map<I, C, L>(
    &self,
    key: Option<Row>,
    constructor: C
) -> (Stream<S, I::Item>, Collection<S, DataflowError, Diff>) where
    I: IntoIterator,
    I::Item: Data,
    C: FnOnce() -> L,
    L: for<'a, 'b> FnMut(&'a [&'b RefOrMut<'b, Row>], &'a S::Timestamp, &'a Diff) -> I + 'static, 

Constructs and applies logic to elements of self and returns the results.

constructor takes a permutation and produces the logic to apply on elements. The logic conceptually receives (&Row, &Row) pairs in the form of a slice. Only after borrowing the elements and applying the permutation the datums will be in the expected order.

If key is set, this is a promise that logic will produce no results on records for which the key does not evaluate to the value. This is used to leap directly to exactly those records.

Trait Implementations

impl<S: Clone + Scope, V: Clone + Data, T: Clone + Lattice> Clone for ArrangementFlavor<S, V, T> where
    T: Timestamp + Lattice,
    S::Timestamp: Lattice + Refines<T>, 

fn clone(&self) -> ArrangementFlavor<S, V, T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.