Struct UpdatesTyped 

pub struct UpdatesTyped<U: Update> {
    pub keys: Lists<ContainerOf<U::Key>>,
    pub vals: Lists<ContainerOf<U::Val>>,
    pub times: Lists<ContainerOf<U::Time>>,
    pub diffs: Lists<ContainerOf<U::Diff>>,
}

Trie-structured update storage using columnar containers.

Four nested layers of Lists:

• keys: lists of keys (outer lists are independent groups)
• vals: per-key, lists of vals
• times: per-val, lists of times
• diffs: per-time, lists of diffs (singletons when consolidated)

A flat unsorted input has stride 1 at every level (one key per entry, one val per key, one time per val, one diff per time). A fully consolidated trie has a single outer key list, all lists sorted and deduplicated, and singleton diff lists.

Fields

keys: Lists<ContainerOf<U::Key>>

Outer key list (one entry per group of keys at the trie root).

vals: Lists<ContainerOf<U::Val>>

Per-key list of vals.

times: Lists<ContainerOf<U::Time>>

Per-val list of times.

diffs: Lists<ContainerOf<U::Diff>>

Per-time list of diffs (one diff per time after consolidation).

Implementations

impl<U: Update> UpdatesTyped<U>

pub fn view(&self) -> UpdatesView<'_, U>

Borrow the four columns as a single UpdatesView.

impl<U: Update> UpdatesTyped<U>

pub fn extend_from_keys( &mut self, other: UpdatesView<'_, U>, key_range: Range<usize>, )

Copies other[key_range] into self, keys and all.

pub fn form_unsorted<'a>( unsorted: impl Iterator<Item = Ref<'a, Tuple<U>>>, ) -> Self

Forms a consolidated UpdatesTyped trie from unsorted (key, val, time, diff) refs.

pub fn form<'a>(sorted: impl Iterator<Item = Ref<'a, Tuple<U>>>) -> Self

Forms a consolidated UpdatesTyped trie from sorted (key, val, time, diff) refs.

pub fn consolidate(self) -> Self

Consolidates into canonical trie form: single outer key list, all lists sorted and deduplicated, diff lists are singletons (or absent if cancelled).

pub fn filter_zero(self) -> Self

Drop entries whose diff list is empty (cancelled), rebuilding the trie.

pub fn len(&self) -> usize

The number of leaf-level diff entries (total updates).

impl<U: Update> UpdatesTyped<U>

pub fn iter( &self, ) -> impl Iterator<Item = (Ref<'_, U::Key>, Ref<'_, U::Val>, Ref<'_, U::Time>, Ref<'_, U::Diff>)>

Iterate all (key, val, time, diff) entries as refs.

Trait Implementations

impl<U: Update> Accountable for UpdatesTyped<U>

fn record_count(&self) -> i64

The number of records

fn is_empty(&self) -> bool

Determine if this contains any updates, corresponding to update_count() == 0. It is a correctness error for this to be anything other than self.record_count() == 0.

impl<U: Update> Clone for UpdatesTyped<U>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<U: Update> ContainerBytes for UpdatesTyped<U>

fn from_bytes(_bytes: Bytes) -> Self

Wrap bytes as Self.

fn length_in_bytes(&self) -> usize

The number of bytes required to serialize the data.

fn into_bytes<W: Write>(&self, _writer: &mut W)

Writes the binary representation into writer.

impl<U: Update> Debug for UpdatesTyped<U>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<U: Update> Default for UpdatesTyped<U>

fn default() -> Self

Returns the “default value” for a type.

impl<U: Update, B> From<UpdatesTyped<U>> for Updates<U, B>

fn from(owned: UpdatesTyped<U>) -> Self

Converts to this type from the input type.

impl<KP, VP, TP, DP, U: Update> Push<(KP, VP, TP, DP)> for UpdatesTyped<U>

where ContainerOf<U::Key>: Push<KP>, ContainerOf<U::Val>: Push<VP>, ContainerOf<U::Time>: Push<TP>, ContainerOf<U::Diff>: Push<DP>,

Push a single flat update as a stride-1 entry.

Each field is independently typed — columnar refs, &Owned, owned values, or any other type the column container accepts via its Push impl.

fn push(&mut self, (key, val, time, diff): (KP, VP, TP, DP))

Pushes an item onto self.

fn extend(&mut self, iter: impl IntoIterator<Item = T>)

Pushes elements of an iterator onto self.

impl<U: Update> PushInto<((<U as ColumnarUpdate>::Key, <U as ColumnarUpdate>::Val), <U as ColumnarUpdate>::Time, <U as ColumnarUpdate>::Diff)> for UpdatesTyped<U>

PushInto for the ((K, V), T, R) shape that reduce_trace uses.

fn push_into( &mut self, ((key, val), time, diff): ((U::Key, U::Val), U::Time, U::Diff), )

Push item into self.

impl<U: Update> PushInto<UpdatesTyped<U>> for MergeBatcher<U>

fn push_into(&mut self, chunk: UpdatesTyped<U>)

Push item into self.