Struct differential_dataflow::trace::layers::ordered_leaf::OrderedLeaf

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

A layer of unordered values.

Fields

vals: Vec<(K, R)>

Unordered values.

Trait Implementations

impl<K: Debug, R: Debug> Debug for OrderedLeaf<K, R>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<K: Eq, R: Eq> Eq for OrderedLeaf<K, R>

impl<K: PartialEq, R: PartialEq> PartialEq for OrderedLeaf<K, R>

fn eq(&self, __arg_0: &OrderedLeaf<K, R>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, __arg_0: &OrderedLeaf<K, R>) -> bool

This method tests for !=.

impl<K: Ord + Clone, R: Diff + Clone> Trie for OrderedLeaf<K, R>

type Item = (K, R)

The type of item from which the type is constructed.

type Cursor = OrderedLeafCursor

The type of cursor used to navigate the type.

type MergeBuilder = OrderedLeafBuilder<K, R>

The type used to merge instances of the type together.

type TupleBuilder = OrderedLeafBuilder<K, R>

The type used to assemble instances of the type from its Items.

fn keys(&self) -> usize

The number of distinct keys, as distinct from the total number of tuples.

fn tuples(&self) -> usize

The total number of tuples in the collection.

fn cursor_from(&self, lower: usize, upper: usize) -> Self::Cursor

Returns a cursor over a range of data, commonly used by others to restrict navigation to sub-collections.

fn cursor(&self) -> Self::Cursor

Returns a cursor capable of navigating the collection.

fn merge(&self, other: &Self) -> Self

Merges two collections into a third.