Struct differential_dataflow::capture::Progress
source · pub struct Progress<T> {
pub lower: Vec<T>,
pub upper: Vec<T>,
pub counts: Vec<(T, usize)>,
}
Expand description
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§
source§impl<T> Abomonation for Progress<T>
impl<T> Abomonation for Progress<T>
source§impl<'de, T> Deserialize<'de> for Progress<T>where
T: Deserialize<'de>,
impl<'de, T> Deserialize<'de> for Progress<T>where
T: Deserialize<'de>,
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl<T: Ord> Ord for Progress<T>
impl<T: Ord> Ord for Progress<T>
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
source§impl<T: PartialEq> PartialEq for Progress<T>
impl<T: PartialEq> PartialEq for Progress<T>
source§impl<T: PartialOrd> PartialOrd for Progress<T>
impl<T: PartialOrd> PartialOrd for Progress<T>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moreimpl<T: Eq> Eq for Progress<T>
impl<T> StructuralPartialEq for Progress<T>
Auto Trait Implementations§
impl<T> Freeze for Progress<T>
impl<T> RefUnwindSafe for Progress<T>where
T: RefUnwindSafe,
impl<T> Send for Progress<T>where
T: Send,
impl<T> Sync for Progress<T>where
T: Sync,
impl<T> Unpin for Progress<T>where
T: Unpin,
impl<T> UnwindSafe for Progress<T>where
T: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<R, O, T> CopyOnto<ConsecutiveOffsetPairs<R, O>> for T
impl<R, O, T> CopyOnto<ConsecutiveOffsetPairs<R, O>> for T
source§fn copy_onto(
self,
target: &mut ConsecutiveOffsetPairs<R, O>
) -> <ConsecutiveOffsetPairs<R, O> as Region>::Index
fn copy_onto( self, target: &mut ConsecutiveOffsetPairs<R, O> ) -> <ConsecutiveOffsetPairs<R, O> as Region>::Index
Copy self into the target container, returning an index that allows to
look up the corresponding read item.