Enum DeltaEntry 

pub enum DeltaEntry<K, V> {
    Insert {
        key: K,
        value: V,
        logical_time: u64,
    },
    Delete {
        key: K,
        logical_time: u64,
    },
}

A signed delta entry representing an incremental change.

The fundamental unit of IVM propagation. Changes flow through the DAG as collections of delta entries, which views transform into output deltas.

Semantics

• Insert(key, value): New or updated mapping at key.
• Delete(key): Key removed from the materialized view.

Both variants carry a logical_time for causal ordering within an epoch.

Variants

Insert

Insert or update: (key, value, logical_time). Weight = +1 in signed-tuple notation.

Fields

key: K

value: V

logical_time: u64

Delete

Delete: (key, logical_time). Weight = -1 in signed-tuple notation.

Fields

key: K

logical_time: u64

Implementations

impl<K, V> DeltaEntry<K, V>

pub fn key(&self) -> &K

The key affected by this delta.

pub fn logical_time(&self) -> u64

The logical time of this delta.

pub fn weight(&self) -> i8

The signed weight: +1 for insert, -1 for delete.

pub fn is_insert(&self) -> bool

Whether this is an insert/update.

Trait Implementations

impl<K: Clone, V: Clone> Clone for DeltaEntry<K, V>

fn clone(&self) -> DeltaEntry<K, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for DeltaEntry<K, V>

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

Formats the value using the given formatter.

impl<K: PartialEq, V: PartialEq> PartialEq for DeltaEntry<K, V>

fn eq(&self, other: &DeltaEntry<K, V>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K, V> StructuralPartialEq for DeltaEntry<K, V>