Struct differential_dataflow::trace::layers::ordered_leaf::OrderedLeafBuilder

pub struct OrderedLeafBuilder<K, R> {
    pub vals: Vec<(K, R)>,
}

A builder for unordered values.

Fields

vals: Vec<(K, R)>

Unordered values.

Trait Implementations

impl<K: Ord + Clone, R: Monoid + Clone> Builder for OrderedLeafBuilder<K, R>

type Trie = OrderedLeaf<K, R>

The type of collection produced.

fn boundary(&mut self) -> usize

Requests a commitment to the offset of the current-most sub-collection.

fn done(self) -> Self::Trie

Finalizes the building process and returns the collection.

impl<K: Ord + Clone, R: Monoid + Clone> MergeBuilder for OrderedLeafBuilder<K, R>

fn with_capacity(other1: &Self::Trie, other2: &Self::Trie) -> Self

Allocates an instance of the builder with sufficient capacity to contain the merged data.

fn copy_range(&mut self, other: &Self::Trie, lower: usize, upper: usize)

Copies sub-collections of other into this collection.

fn push_merge(
    &mut self,
    other1: (&Self::Trie, usize, usize),
    other2: (&Self::Trie, usize, usize)
) -> usize

Merges two sub-collections into one sub-collection.

impl<K: Ord + Clone, R: Monoid + Clone> TupleBuilder for OrderedLeafBuilder<K, R>

type Item = (K, R)

The type of item accepted for construction.

fn new() -> Self

Allocates a new builder.

fn with_capacity(cap: usize) -> Self

Allocates a new builder with capacity for at least cap tuples.

fn push_tuple(&mut self, tuple: (K, R))

Inserts a new into the collection.