Struct differential_dataflow::collection::Collection

pub struct Collection<G: Scope, D, R: Semigroup = isize> {
    pub inner: Stream<G, (D, G::Timestamp, R)>,
}

A mutable collection of values of type D

The Collection type is the core abstraction in differential dataflow programs. As you write your differential dataflow computation, you write as if the collection is a static dataset to which you apply functional transformations, creating new collections. Once your computation is written, you are able to mutate the collection (by inserting and removing elements); differential dataflow will propagate changes through your functional computation and report the corresponding changes to the output collections.

Each collection has three generic parameters. The parameter G is for the scope in which the collection exists; as you write more complicated programs you may wish to introduce nested scopes (e.g. for iteration) and this parameter tracks the scope (for timely dataflow's benefit). The D parameter is the type of data in your collection, for example String, or (u32, Vec<Option<()>>). The R parameter represents the types of changes that the data undergo, and is most commonly (and defaults to) isize, representing changes to the occurrence count of each record.

Fields

inner: Stream<G, (D, G::Timestamp, R)>

The underlying timely dataflow stream.

This field is exposed to support direct timely dataflow manipulation when required, but it is not intended to be the idiomatic way to work with the collection.

Methods

impl<G: Scope, D: Data, R: Semigroup> Collection<G, D, R> where
    G::Timestamp: Data, 

pub fn new(stream: Stream<G, (D, G::Timestamp, R)>) -> Collection<G, D, R>

Creates a new Collection from a timely dataflow stream.

This method seems to be rarely used, with the as_collection method on streams being a more idiomatic approach to convert timely streams to collections. Also, the input::Input trait provides a new_collection method which will create a new collection for you without exposing the underlying timely stream at all.

pub fn map<D2, L>(&self, logic: L) -> Collection<G, D2, R> where
    D2: Data,
    L: FnMut(D) -> D2 + 'static, 

Creates a new collection by applying the supplied function to each input element.

Examples

extern crate timely;
extern crate differential_dataflow;

use differential_dataflow::input::Input;

fn main() {
    ::timely::example(|scope| {
        scope.new_collection_from(1 .. 10).1
             .map(|x| x * 2)
             .filter(|x| x % 2 == 1)
             .assert_empty();
    });
}

pub fn map_in_place<L>(&self, logic: L) -> Collection<G, D, R> where
    L: FnMut(&mut D) + 'static, 

Creates a new collection by applying the supplied function to each input element.

Although the name suggests in-place mutation, this function does not change the source collection, but rather re-uses the underlying allocations in its implementation. The method is semantically equivalent to map, but can be more efficient.

Examples

extern crate timely;
extern crate differential_dataflow;

use differential_dataflow::input::Input;

fn main() {
    ::timely::example(|scope| {
        scope.new_collection_from(1 .. 10).1
             .map_in_place(|x| *x *= 2)
             .filter(|x| x % 2 == 1)
             .assert_empty();
    });
}

pub fn flat_map<I, L>(&self, logic: L) -> Collection<G, I::Item, R> where
    G::Timestamp: Clone,
    I: IntoIterator,
    I::Item: Data,
    L: FnMut(D) -> I + 'static, 

Creates a new collection by applying the supplied function to each input element and accumulating the results.

This method extracts an iterator from each input element, and extracts the full contents of the iterator. Be warned that if the iterators produce substantial amounts of data, they are currently fully drained before attempting to consolidate the results.

Examples

extern crate timely;
extern crate differential_dataflow;

use differential_dataflow::input::Input;

fn main() {
    ::timely::example(|scope| {
        scope.new_collection_from(1 .. 10).1
             .flat_map(|x| 0 .. x);
    });
}

pub fn filter<L>(&self, logic: L) -> Collection<G, D, R> where
    L: FnMut(&D) -> bool + 'static, 

Creates a new collection containing those input records satisfying the supplied predicate.

Examples

extern crate timely;
extern crate differential_dataflow;

use differential_dataflow::input::Input;

fn main() {
    ::timely::example(|scope| {
        scope.new_collection_from(1 .. 10).1
             .map(|x| x * 2)
             .filter(|x| x % 2 == 1)
             .assert_empty();
    });
}

pub fn concat(&self, other: &Collection<G, D, R>) -> Collection<G, D, R>

Creates a new collection accumulating the contents of the two collections.

Despite the name, differential dataflow collections are unordered. This method is so named because the implementation is the concatenation of the stream of updates, but it corresponds to the addition of the two collections.

Examples

extern crate timely;
extern crate differential_dataflow;

use differential_dataflow::input::Input;

fn main() {
    ::timely::example(|scope| {

        let data = scope.new_collection_from(1 .. 10).1;

        let odds = data.filter(|x| x % 2 == 1);
        let evens = data.filter(|x| x % 2 == 0);

        odds.concat(&evens)
            .assert_eq(&data);
    });
}

pub fn concatenate<I>(&self, sources: I) -> Collection<G, D, R> where
    I: IntoIterator<Item = Collection<G, D, R>>, 

Creates a new collection accumulating the contents of the two collections.

Despite the name, differential dataflow collections are unordered. This method is so named because the implementation is the concatenation of the stream of updates, but it corresponds to the addition of the two collections.

Examples

extern crate timely;
extern crate differential_dataflow;

use differential_dataflow::input::Input;

fn main() {
    ::timely::example(|scope| {

        let data = scope.new_collection_from(1 .. 10).1;

        let odds = data.filter(|x| x % 2 == 1);
        let evens = data.filter(|x| x % 2 == 0);

        odds.concatenate(Some(evens))
            .assert_eq(&data);
    });
}

pub fn explode<D2, R2, I, L>(
    &self,
    logic: L
) -> Collection<G, D2, <R2 as Mul<R>>::Output> where
    D2: Data,
    R2: Semigroup + Mul<R>,
    <R2 as Mul<R>>::Output: Data + Semigroup,
    I: IntoIterator<Item = (D2, R2)>,
    L: FnMut(D) -> I + 'static, 

Replaces each record with another, with a new difference type.

This method is most commonly used to take records containing aggregatable data (e.g. numbers to be summed) and move the data into the difference component. This will allow differential dataflow to update in-place.

#Examples

extern crate timely;
extern crate differential_dataflow;

use differential_dataflow::input::Input;

fn main() {
    ::timely::example(|scope| {

        let nums = scope.new_collection_from(0 .. 10).1;
        let x1 = nums.flat_map(|x| 0 .. x);
        let x2 = nums.map(|x| (x, 9 - x))
                     .explode(|(x,y)| Some((x,y)));

        x1.assert_eq(&x2);
    });
}

pub fn enter<'a, T>(
    &self,
    child: &Child<'a, G, T>
) -> Collection<Child<'a, G, T>, D, R> where
    T: Refines<<G as ScopeParent>::Timestamp>, 

Brings a Collection into a nested scope.

Examples

extern crate timely;
extern crate differential_dataflow;

use timely::dataflow::Scope;
use differential_dataflow::input::Input;

fn main() {
    ::timely::example(|scope| {

        let data = scope.new_collection_from(1 .. 10).1;

        let result = scope.region(|child| {
            data.enter(child)
                .leave()
        });

        data.assert_eq(&result);
    });
}

pub fn enter_at<'a, T, F>(
    &self,
    child: &Iterative<'a, G, T>,
    initial: F
) -> Collection<Iterative<'a, G, T>, D, R> where
    T: Timestamp + Hash,
    F: FnMut(&D) -> T + Clone + 'static,
    G::Timestamp: Hash, 

Brings a Collection into a nested scope, at varying times.

The initial function indicates the time at which each element of the Collection should appear.

Examples

extern crate timely;
extern crate differential_dataflow;

use timely::dataflow::Scope;
use differential_dataflow::input::Input;

fn main() {
    ::timely::example(|scope| {

        let data = scope.new_collection_from(1 .. 10).1;

        let result = scope.iterative::<u64,_,_>(|child| {
            data.enter_at(child, |x| *x)
                .leave()
        });

        data.assert_eq(&result);
    });
}

pub fn delay<F>(&self, func: F) -> Collection<G, D, R> where
    F: FnMut(&G::Timestamp) -> G::Timestamp + Clone + 'static, 

Delays each difference by a supplied function.

It is assumed that func only advances timestamps; this is not verified, and things may go horribly wrong if that assumption is incorrect. It is also critical that func be monotonic: if two times are ordered, they should have the same order once func is applied to them (this is because we advance the timely capability with the same logic, and it must remain less_equal to all of the data timestamps).

pub fn inspect<F>(&self, func: F) -> Collection<G, D, R> where
    F: FnMut(&(D, G::Timestamp, R)) + 'static, 

Applies a supplied function to each update.

This method is most commonly used to report information back to the user, often for debugging purposes. Any function can be used here, but be warned that the incremental nature of differential dataflow does not guarantee that it will be called as many times as you might expect.

The (data, time, diff) triples indicate a change diff to the frequency of data which takes effect at the logical time time. When times are totally ordered (for example, usize), these updates reflect the changes along the sequence of collections. For partially ordered times, the mathematics are more interesting and less intuitive, unfortunately.

Examples

extern crate timely;
extern crate differential_dataflow;

use differential_dataflow::input::Input;

fn main() {
    ::timely::example(|scope| {
        scope.new_collection_from(1 .. 10).1
             .map_in_place(|x| *x *= 2)
             .filter(|x| x % 2 == 1)
             .inspect(|x| println!("error: {:?}", x));
    });
}

pub fn inspect_batch<F>(&self, func: F) -> Collection<G, D, R> where
    F: FnMut(&G::Timestamp, &[(D, G::Timestamp, R)]) + 'static, 

Applies a supplied function to each batch of updates.

This method is analogous to inspect, but operates on batches and reveals the timestamp of the timely dataflow capability associated with the batch of updates. The observed batching depends on how the system executes, and may vary run to run.

Examples

extern crate timely;
extern crate differential_dataflow;

use differential_dataflow::input::Input;

fn main() {
    ::timely::example(|scope| {
        scope.new_collection_from(1 .. 10).1
             .map_in_place(|x| *x *= 2)
             .filter(|x| x % 2 == 1)
             .inspect_batch(|t,xs| println!("errors @ {:?}: {:?}", t, xs));
    });
}

pub fn probe(&self) -> Handle<G::Timestamp>

Attaches a timely dataflow probe to the output of a Collection.

This probe is used to determine when the state of the Collection has stabilized and can be read out.

pub fn probe_with(
    &self,
    handle: &mut Handle<G::Timestamp>
) -> Collection<G, D, R>

Attaches a timely dataflow probe to the output of a Collection.

This probe is used to determine when the state of the Collection has stabilized and all updates observed. In addition, a probe is also often use to limit the number of rounds of input in flight at any moment; a computation can wait until the probe has caught up to the input before introducing more rounds of data, to avoid swamping the system.

pub fn assert_empty(&self) where
    D: ExchangeData + Hashable,
    R: ExchangeData + Hashable,
    G::Timestamp: Lattice + Ord, 

Assert if the collection is ever non-empty.

Because this is a dataflow fragment, the test is only applied as the computation is run. If the computation is not run, or not run to completion, there may be un-exercised times at which the collection could be non-empty. Typically, a timely dataflow computation runs to completion on drop, and so clean exit from a program should indicate that this assertion never found cause to complain.

Examples

extern crate timely;
extern crate differential_dataflow;

use differential_dataflow::input::Input;

fn main() {
    ::timely::example(|scope| {
        scope.new_collection_from(1 .. 10).1
             .map(|x| x * 2)
             .filter(|x| x % 2 == 1)
             .assert_empty();
    });
}

pub fn scope(&self) -> G

The scope containing the underlying timely dataflow stream.

impl<'a, G: Scope, T: Timestamp, D: Data, R: Semigroup> Collection<Child<'a, G, T>, D, R> where
    T: Refines<<G as ScopeParent>::Timestamp>, 

pub fn leave(&self) -> Collection<G, D, R>

Returns the final value of a Collection from a nested scope to its containing scope.

Examples

extern crate timely;
extern crate differential_dataflow;

use timely::dataflow::Scope;
use differential_dataflow::input::Input;

fn main() {
    ::timely::example(|scope| {

        let data = scope.new_collection_from(1 .. 10).1;

        let result = scope.region(|child| {
            data.enter(child)
                .leave()
        });

        data.assert_eq(&result);
    });
}

impl<G: Scope, D: Data, R: Abelian> Collection<G, D, R> where
    G::Timestamp: Data, 

pub fn negate(&self) -> Collection<G, D, R>

Creates a new collection whose counts are the negation of those in the input.

This method is most commonly used with concat to get those element in one collection but not another. However, differential dataflow computations are still defined for all values of the difference type R, including negative counts.

Examples

extern crate timely;
extern crate differential_dataflow;

use differential_dataflow::input::Input;

fn main() {
    ::timely::example(|scope| {

        let data = scope.new_collection_from(1 .. 10).1;

        let odds = data.filter(|x| x % 2 == 1);
        let evens = data.filter(|x| x % 2 == 0);

        odds.negate()
            .concat(&data)
            .assert_eq(&evens);
    });
}

pub fn assert_eq(&self, other: &Self) where
    D: ExchangeData + Hashable,
    R: ExchangeData + Hashable,
    G::Timestamp: Lattice + Ord, 

Assert if the collections are ever different.

Because this is a dataflow fragment, the test is only applied as the computation is run. If the computation is not run, or not run to completion, there may be un-exercised times at which the collections could vary. Typically, a timely dataflow computation runs to completion on drop, and so clean exit from a program should indicate that this assertion never found cause to complain.

Examples

extern crate timely;
extern crate differential_dataflow;

use differential_dataflow::input::Input;

fn main() {
    ::timely::example(|scope| {

        let data = scope.new_collection_from(1 .. 10).1;

        let odds = data.filter(|x| x % 2 == 1);
        let evens = data.filter(|x| x % 2 == 0);

        odds.concat(&evens)
            .assert_eq(&data);
    });
}

Trait Implementations

impl<G, K, V, R> Arrange<G, K, V, R> for Collection<G, (K, V), R> where
    G: Scope,
    G::Timestamp: Lattice + Ord,
    K: ExchangeData + Hashable,
    V: ExchangeData,
    R: Semigroup + ExchangeData, 

fn arrange_core<P, Tr>(
    &self,
    pact: P,
    name: &str
) -> Arranged<G, TraceAgent<Tr>> where
    P: ParallelizationContract<G::Timestamp, ((K, V), G::Timestamp, R)>,
    Tr: Trace + TraceReader<Key = K, Val = V, Time = G::Timestamp, R = R> + 'static,
    Tr::Batch: Batch<K, V, G::Timestamp, R>,
    Tr::Cursor: Cursor<K, V, G::Timestamp, R>, 

Arranges a stream of (Key, Val) updates by Key. Accepts an empty instance of the trace type.

fn arrange<Tr>(&self) -> Arranged<G, TraceAgent<Tr>> where
    K: ExchangeData + Hashable,
    V: ExchangeData,
    R: ExchangeData,
    Tr: Trace + TraceReader<Key = K, Val = V, Time = G::Timestamp, R = R> + 'static,
    Tr::Batch: Batch<K, V, G::Timestamp, R>,
    Tr::Cursor: Cursor<K, V, G::Timestamp, R>, 

Arranges a stream of (Key, Val) updates by Key. Accepts an empty instance of the trace type.

fn arrange_named<Tr>(&self, name: &str) -> Arranged<G, TraceAgent<Tr>> where
    K: ExchangeData + Hashable,
    V: ExchangeData,
    R: ExchangeData,
    Tr: Trace + TraceReader<Key = K, Val = V, Time = G::Timestamp, R = R> + 'static,
    Tr::Batch: Batch<K, V, G::Timestamp, R>,
    Tr::Cursor: Cursor<K, V, G::Timestamp, R>, 

Arranges a stream of (Key, Val) updates by Key. Accepts an empty instance of the trace type.

impl<G: Scope, K: ExchangeData + Hashable, R: ExchangeData + Semigroup> Arrange<G, K, (), R> for Collection<G, K, R> where
    G::Timestamp: Lattice + Ord, 

fn arrange_core<P, Tr>(
    &self,
    pact: P,
    name: &str
) -> Arranged<G, TraceAgent<Tr>> where
    P: ParallelizationContract<G::Timestamp, ((K, ()), G::Timestamp, R)>,
    Tr: Trace + TraceReader<Key = K, Val = (), Time = G::Timestamp, R = R> + 'static,
    Tr::Batch: Batch<K, (), G::Timestamp, R>,
    Tr::Cursor: Cursor<K, (), G::Timestamp, R>, 

Arranges a stream of (Key, Val) updates by Key. Accepts an empty instance of the trace type.

fn arrange<Tr>(&self) -> Arranged<G, TraceAgent<Tr>> where
    K: ExchangeData + Hashable,
    V: ExchangeData,
    R: ExchangeData,
    Tr: Trace + TraceReader<Key = K, Val = V, Time = G::Timestamp, R = R> + 'static,
    Tr::Batch: Batch<K, V, G::Timestamp, R>,
    Tr::Cursor: Cursor<K, V, G::Timestamp, R>, 

Arranges a stream of (Key, Val) updates by Key. Accepts an empty instance of the trace type.

fn arrange_named<Tr>(&self, name: &str) -> Arranged<G, TraceAgent<Tr>> where
    K: ExchangeData + Hashable,
    V: ExchangeData,
    R: ExchangeData,
    Tr: Trace + TraceReader<Key = K, Val = V, Time = G::Timestamp, R = R> + 'static,
    Tr::Batch: Batch<K, V, G::Timestamp, R>,
    Tr::Cursor: Cursor<K, V, G::Timestamp, R>, 

Arranges a stream of (Key, Val) updates by Key. Accepts an empty instance of the trace type.

impl<G: Scope, K: ExchangeData + Hashable, V: ExchangeData, R: ExchangeData + Semigroup> ArrangeByKey<G, K, V, R> for Collection<G, (K, V), R> where
    G::Timestamp: Lattice + Ord, 

fn arrange_by_key(
    &self
) -> Arranged<G, TraceAgent<DefaultValTrace<K, V, G::Timestamp, R>>>

Arranges a collection of (Key, Val) records by Key.

impl<G: Scope, K: ExchangeData + Hashable, R: ExchangeData + Semigroup> ArrangeBySelf<G, K, R> for Collection<G, K, R> where
    G::Timestamp: Lattice + Ord, 

fn arrange_by_self(
    &self
) -> Arranged<G, TraceAgent<DefaultKeyTrace<K, G::Timestamp, R>>>

Arranges a collection of Key records by Key.

impl<G, K, V, R> Reduce<G, K, V, R> for Collection<G, (K, V), R> where
    G: Scope,
    G::Timestamp: Lattice + Ord,
    K: ExchangeData + Hashable,
    V: ExchangeData,
    R: ExchangeData + Semigroup, 

fn reduce_named<L, V2: Data, R2: Abelian>(
    &self,
    name: &str,
    logic: L
) -> Collection<G, (K, V2), R2> where
    L: FnMut(&K, &[(&V, R)], &mut Vec<(V2, R2)>) + 'static, 

As reduce with the ability to name the operator.

fn reduce<L, V2: Data, R2: Abelian>(
    &self,
    logic: L
) -> Collection<G, (K, V2), R2> where
    L: FnMut(&K, &[(&V, R)], &mut Vec<(V2, R2)>) + 'static, 

Applies a reduction function on records grouped by key.

impl<G: Scope, K: ExchangeData + Hashable, R1: ExchangeData + Semigroup> Threshold<G, K, R1> for Collection<G, K, R1> where
    G::Timestamp: Lattice + Ord, 

fn threshold_named<R2: Abelian, F: FnMut(&K, &R1) -> R2 + 'static>(
    &self,
    name: &str,
    thresh: F
) -> Collection<G, K, R2>

A threshold with the ability to name the operator.

fn threshold<R2: Abelian, F: FnMut(&K, &R1) -> R2 + 'static>(
    &self,
    thresh: F
) -> Collection<G, K, R2>

Transforms the multiplicity of records.

fn distinct(&self) -> Collection<G, K, isize>

Reduces the collection to one occurrence of each distinct element.

fn distinct_core<R2: Abelian + From<i8>>(&self) -> Collection<G, K, R2>

Distinct for general integer differences.

impl<G: Scope, K: ExchangeData + Hashable, R: ExchangeData + Semigroup> Count<G, K, R> for Collection<G, K, R> where
    G::Timestamp: Lattice + Ord, 

fn count(&self) -> Collection<G, (K, R), isize>

Counts the number of occurrences of each element.

impl<G, K, V, R> ReduceCore<G, K, V, R> for Collection<G, (K, V), R> where
    G: Scope,
    G::Timestamp: Lattice + Ord,
    K: ExchangeData + Hashable,
    V: ExchangeData,
    R: ExchangeData + Semigroup, 

fn reduce_core<L, T2>(
    &self,
    name: &str,
    logic: L
) -> Arranged<G, TraceAgent<T2>> where
    T2::Val: Data,
    T2::R: Semigroup,
    T2: Trace + TraceReader<Key = K, Time = G::Timestamp> + 'static,
    T2::Batch: Batch<K, T2::Val, G::Timestamp, T2::R>,
    T2::Cursor: Cursor<K, T2::Val, G::Timestamp, T2::R>,
    L: FnMut(&K, &[(&V, R)], &mut Vec<(T2::Val, T2::R)>, &mut Vec<(T2::Val, T2::R)>) + 'static, 

Solves for output updates when presented with inputs and would-be outputs.

fn reduce_abelian<L, T2>(
    &self,
    name: &str,
    logic: L
) -> Arranged<G, TraceAgent<T2>> where
    T2: Trace + TraceReader<Key = K, Time = G::Timestamp> + 'static,
    T2::Val: Data,
    T2::R: Abelian,
    T2::Batch: Batch<K, T2::Val, G::Timestamp, T2::R>,
    T2::Cursor: Cursor<K, T2::Val, G::Timestamp, T2::R>,
    L: FnMut(&K, &[(&V, R)], &mut Vec<(T2::Val, T2::R)>) + 'static, 

Applies group to arranged data, and returns an arrangement of output data.

impl<G: Scope, D, R> Consolidate<D> for Collection<G, D, R> where
    D: ExchangeData + Hashable,
    R: ExchangeData + Semigroup,
    G::Timestamp: Lattice + Ord, 

fn consolidate_named(&self, name: &str) -> Self

As consolidate but with the ability to name the operator.

fn consolidate(&self) -> Self

Aggregates the weights of equal records into at most one record.

impl<G: Scope, D, R> ConsolidateStream<D> for Collection<G, D, R> where
    D: ExchangeData + Hashable,
    R: ExchangeData + Semigroup,
    G::Timestamp: Lattice + Ord, 

fn consolidate_stream(&self) -> Self

Aggregates the weights of equal records.

impl<G: Scope, D: Ord + Data + Debug, R: Abelian> Iterate<G, D, R> for Collection<G, D, R>

fn iterate<F>(&self, logic: F) -> Collection<G, D, R> where
    G::Timestamp: Lattice,
    F: FnOnce(&Collection<Iterative<'a, G, u64>, D, R>) -> Collection<Iterative<'a, G, u64>, D, R>, 

Iteratively apply logic to the source collection until convergence.

impl<G, K, V, R> Join<G, K, V, R> for Collection<G, (K, V), R> where
    G: Scope,
    K: ExchangeData + Hashable,
    V: ExchangeData,
    R: ExchangeData + Semigroup,
    G::Timestamp: Lattice + Ord, 

fn join_map<V2: ExchangeData, R2: ExchangeData + Semigroup, D: Data, L>(
    &self,
    other: &Collection<G, (K, V2), R2>,
    logic: L
) -> Collection<G, D, <R as Mul<R2>>::Output> where
    R: Mul<R2>,
    <R as Mul<R2>>::Output: Semigroup,
    L: FnMut(&K, &V, &V2) -> D + 'static, 

Matches pairs (key,val1) and (key,val2) based on key and then applies a function.

fn semijoin<R2: ExchangeData + Semigroup>(
    &self,
    other: &Collection<G, K, R2>
) -> Collection<G, (K, V), <R as Mul<R2>>::Output> where
    R: Mul<R2>,
    <R as Mul<R2>>::Output: Semigroup, 

Matches pairs (key, val) and key based on key, producing the former with frequencies multiplied.

fn antijoin<R2: ExchangeData + Semigroup>(
    &self,
    other: &Collection<G, K, R2>
) -> Collection<G, (K, V), R> where
    R: Mul<R2, Output = R>,
    R: Abelian, 

Subtracts the semijoin with other from self.

fn join<V2, R2>(
    &self,
    other: &Collection<G, (K, V2), R2>
) -> Collection<G, (K, (V, V2)), <R as Mul<R2>>::Output> where
    K: ExchangeData,
    V2: ExchangeData,
    R2: ExchangeData + Semigroup,
    R: Mul<R2>,
    <R as Mul<R2>>::Output: Semigroup, 

Matches pairs (key,val1) and (key,val2) based on key and then applies a function.

impl<G, K, V, R> JoinCore<G, K, V, R> for Collection<G, (K, V), R> where
    G: Scope,
    K: ExchangeData + Hashable,
    V: ExchangeData,
    R: ExchangeData + Semigroup,
    G::Timestamp: Lattice + Ord, 

fn join_core<Tr2, I, L>(
    &self,
    stream2: &Arranged<G, Tr2>,
    result: L
) -> Collection<G, I::Item, <R as Mul<Tr2::R>>::Output> where
    Tr2: TraceReader<Key = K, Time = G::Timestamp> + Clone + 'static,
    Tr2::Batch: BatchReader<K, Tr2::Val, G::Timestamp, Tr2::R> + 'static,
    Tr2::Cursor: Cursor<K, Tr2::Val, G::Timestamp, Tr2::R> + 'static,
    Tr2::Val: Ord + Clone + Debug + 'static,
    Tr2::R: Semigroup,
    R: Mul<Tr2::R>,
    <R as Mul<Tr2::R>>::Output: Semigroup,
    I: IntoIterator,
    I::Item: Data,
    L: FnMut(&K, &V, &Tr2::Val) -> I + 'static, 

Joins two arranged collections with the same key type.

impl<G: Scope, K: ExchangeData + Hashable, R: ExchangeData + Semigroup> CountTotal<G, K, R> for Collection<G, K, R> where
    G::Timestamp: TotalOrder + Lattice + Ord, 

fn count_total(&self) -> Collection<G, (K, R), isize>

Counts the number of occurrences of each element.

impl<G: Scope, K: ExchangeData + Hashable, R: ExchangeData + Semigroup> ThresholdTotal<G, K, R> for Collection<G, K, R> where
    G::Timestamp: TotalOrder + Lattice + Ord, 

fn threshold_semigroup<R2, F>(&self, thresh: F) -> Collection<G, K, R2> where
    R2: Semigroup,
    F: FnMut(&K, &R, Option<&R>) -> Option<R2> + 'static, 

Reduces the collection to one occurrence of each distinct element.

fn threshold_total<R2: Abelian, F: FnMut(&K, &R) -> R2 + 'static>(
    &self,
    thresh: F
) -> Collection<G, K, R2>

Reduces the collection to one occurrence of each distinct element.

fn distinct_total(&self) -> Collection<G, K, isize>

Reduces the collection to one occurrence of each distinct element.

fn distinct_total_core<R2: Abelian + From<i8>>(&self) -> Collection<G, K, R2>

Distinct for general integer differences.

impl<G, D, R> Identifiers<G, D, R> for Collection<G, D, R> where
    G: Scope,
    G::Timestamp: Lattice,
    D: ExchangeData + Hash,
    R: ExchangeData + Abelian, 

fn identifiers(&self) -> Collection<G, (D, u64), R>

Assign unique identifiers to elements of a collection.

impl<G, K, D> PrefixSum<G, K, D> for Collection<G, ((usize, K), D)> where
    G: Scope,
    G::Timestamp: Lattice,
    K: ExchangeData + Hash,
    D: ExchangeData + Hash, 

fn prefix_sum<F>(&self, zero: D, combine: F) -> Self where
    F: Fn(&K, &D, &D) -> D + 'static, 

Computes the prefix sum for each element in the collection.

fn prefix_sum_at<F>(
    &self,
    locations: Collection<G, (usize, K)>,
    zero: D,
    combine: F
) -> Self where
    F: Fn(&K, &D, &D) -> D + 'static, 

Determine the prefix sum at each element of location.

impl<G: Clone + Scope, D: Clone, R: Clone + Semigroup> Clone for Collection<G, D, R> where
    G::Timestamp: Clone, 

fn clone(&self) -> Collection<G, D, R>

Returns a copy of the value.

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

Performs copy-assignment from source.