Struct Product

pub struct Product<TOuter, TInner> {
    pub outer: TOuter,
    pub inner: TInner,
}

A nested pair of timestamps, one outer and one inner.

We use Product rather than (TOuter, TInner) so that we can derive our own PartialOrder, because Rust just uses the lexicographic total order.

Fields

outer: TOuter

Outer timestamp.

inner: TInner

Inner timestamp.

Implementations

impl<TOuter, TInner> Product<TOuter, TInner>

pub fn new(outer: TOuter, inner: TInner) -> Self

Creates a new product from outer and inner coordinates.

Trait Implementations

impl<TOuter, TInner> Abomonation for Product<TOuter, TInner>

where TOuter: Abomonation, TInner: Abomonation,

unsafe fn entomb<W: Write>(&self, _write: &mut W) -> Result<()>

Write any additional information about &self beyond its binary representation.

fn extent(&self) -> usize

Reports the number of further bytes required to entomb self.

unsafe fn exhume<'a, 'b>( &'a mut self, bytes: &'b mut [u8], ) -> Option<&'b mut [u8]>

Recover any information for &mut self not evident from its binary representation.

impl<TOuter: Clone, TInner: Clone> Clone for Product<TOuter, TInner>

fn clone(&self) -> Product<TOuter, TInner>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T1: Columnation, T2: Columnation> Columnation for Product<T1, T2>

type InnerRegion = ProductRegion<<T1 as Columnation>::InnerRegion, <T2 as Columnation>::InnerRegion>

The type of region capable of absorbing allocations owned by the Self type. Note: not allocations of Self, but of the things that it owns.

impl<TOuter: Debug, TInner: Debug> Debug for Product<TOuter, TInner>

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

Formats the value using the given formatter.

impl<TOuter: Default, TInner: Default> Default for Product<TOuter, TInner>

fn default() -> Product<TOuter, TInner>

Returns the “default value” for a type.

impl<'de, TOuter, TInner> Deserialize<'de> for Product<TOuter, TInner>

where TOuter: Deserialize<'de>, TInner: Deserialize<'de>,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<TOuter: Hash, TInner: Hash> Hash for Product<TOuter, TInner>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<TOuter: Ord, TInner: Ord> Ord for Product<TOuter, TInner>

fn cmp(&self, other: &Product<TOuter, TInner>) -> 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,

Restrict a value to a certain interval.

impl<TOuter: PartialEq, TInner: PartialEq> PartialEq for Product<TOuter, TInner>

fn eq(&self, other: &Product<TOuter, TInner>) -> 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<TOuter: PartialOrd, TInner: PartialOrd> PartialOrd for Product<TOuter, TInner>

fn partial_cmp(&self, other: &Product<TOuter, TInner>) -> 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<TOuter: PartialOrder, TInner: PartialOrder> PartialOrder for Product<TOuter, TInner>

fn less_equal(&self, other: &Self) -> bool

Returns true iff one element is less than or equal to the other.

fn less_than(&self, other: &Self) -> bool

Returns true iff one element is strictly less than the other.

impl<TOuter: Timestamp, TInner: Timestamp> PathSummary<Product<TOuter, TInner>> for Product<TOuter::Summary, TInner::Summary>

fn results_in( &self, product: &Product<TOuter, TInner>, ) -> Option<Product<TOuter, TInner>>

Advances a timestamp according to the timestamp actions on the path.

fn followed_by(&self, other: &Self) -> Option<Self>

Composes this path summary with another path summary.

impl<TOuter: Timestamp, TInner: Timestamp> Refines<TOuter> for Product<TOuter, TInner>

fn to_inner(other: TOuter) -> Self

Converts the outer timestamp to an inner timestamp.

fn to_outer(self: Product<TOuter, TInner>) -> TOuter

Converts the inner timestamp to an outer timestamp.

fn summarize( path: <Self as Timestamp>::Summary, ) -> <TOuter as Timestamp>::Summary

Summarizes an inner path summary as an outer path summary.

impl<TOuter, TInner> Serialize for Product<TOuter, TInner>

where TOuter: Serialize, TInner: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<TOuter: Timestamp, TInner: Timestamp> Timestamp for Product<TOuter, TInner>

type Summary = Product<<TOuter as Timestamp>::Summary, <TInner as Timestamp>::Summary>

A type summarizing action on a timestamp along a dataflow path.

fn minimum() -> Self

A minimum value suitable as a default.

impl<TOuter: Copy, TInner: Copy> Copy for Product<TOuter, TInner>

impl<T1: Empty, T2: Empty> Empty for Product<T1, T2>

impl<TOuter: Eq, TInner: Eq> Eq for Product<TOuter, TInner>

impl<TOuter, TInner> StructuralPartialEq for Product<TOuter, TInner>

impl<T1, T2> TotalOrder for Product<T1, T2>

where T1: Empty, T2: TotalOrder,