Struct differential_dataflow::capture::Progress

pub struct Progress<T> {
    pub lower: Vec<T>,
    pub upper: Vec<T>,
    pub counts: Vec<(T, usize)>,
}

An irrevocable statement about the number of updates at times within an interval.

This statement covers all times beyond lower and not beyond upper. Each element of counts is an irrevocable statement about the exact number of distinct updates that occur at that time. Times not present in counts have a count of zero.

Fields

lower: Vec<T>

The lower bound of times contained in this statement.

upper: Vec<T>

The upper bound of times contained in this statement.

counts: Vec<(T, usize)>

All non-zero counts for times beyond lower and not beyond upper.

Trait Implementations

impl<T: Clone> Clone for Progress<T>

fn clone(&self) -> Progress<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Progress<T>

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

Formats the value using the given formatter.

impl<'de, T> Deserialize<'de> for Progress<T>

where T: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: Ord> Ord for Progress<T>

fn cmp(&self, other: &Progress<T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl<T: PartialEq> PartialEq for Progress<T>

fn eq(&self, other: &Progress<T>) -> 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<T: PartialOrd> PartialOrd for Progress<T>

fn partial_cmp(&self, other: &Progress<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T> Serialize for Progress<T>

where T: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: Eq> Eq for Progress<T>

impl<T> StructuralPartialEq for Progress<T>