Struct Product 

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

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

Fields

outer: TOuter

Outer timestamp.

inner: TInner

Inner timestamp.

Implementations

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

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

Creates a new product from outer and inner coordinates.

Trait Implementations

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

where TOuter: Archive + Archive, TInner: Archive + Archive, <TOuter as Archive>::Archived: Ord, <TInner as Archive>::Archived: Ord,

type Archived = ArchivedProduct<TOuter, TInner>

The archived representation of this type.

type Resolver = ProductResolver<TOuter, TInner>

The resolver for this type. It must contain all the additional information from serializing needed to make the archived type from the normal type.

unsafe fn resolve( &self, pos: usize, resolver: Self::Resolver, out: *mut Self::Archived, )

Creates the archived version of this value at the given position and writes it to the given output.

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<TOuter: Copy, TInner: Copy> Copy for Product<TOuter, TInner>

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

Debug implementation to avoid seeing fully qualified path names.

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<__D: Fallible + ?Sized, TOuter, TInner> Deserialize<Product<TOuter, TInner>, __D> for Archived<Product<TOuter, TInner>>

where TOuter: Archive, TInner: Archive, <TOuter as Archive>::Archived: Ord, <TInner as Archive>::Archived: Ord, Archived<TOuter>: Deserialize<TOuter, __D>, Archived<TInner>: Deserialize<TInner, __D>,

fn deserialize( &self, deserializer: &mut __D, ) -> Result<Product<TOuter, TInner>, __D::Error>

Deserializes using the given deserializer

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

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

Formats the value using the given formatter.

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

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, TInner> IsNone for Product<TOuter, TInner>

type Inner = Product<TOuter, TInner>

fn is_none(&self) -> bool

fn unwrap_or_self(&self) -> &Self::Inner

fn from_inner(inner: Self::Inner) -> Self

fn result_to_field<E>(r: Result<Self, E>) -> Result<Self, E>

where Self: Sized,

If Self is Option<T> an Err is converted as Ok(None). For all other types the error is propagated unchanged.

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

fn join(&self, other: &Product<T1, T2>) -> Product<T1, T2>

The smallest element greater than or equal to both arguments.

fn meet(&self, other: &Product<T1, T2>) -> Product<T1, T2>

The largest element less than or equal to both arguments.

fn join_assign(&mut self, other: &Self)

where Self: Sized,

Updates self to the smallest element greater than or equal to both arguments.

fn meet_assign(&mut self, other: &Self)

where Self: Sized,

Updates self to the largest element less than or equal to both arguments.

fn advance_by(&mut self, frontier: AntichainRef<'_, Self>)

where Self: Sized,

Advances self to the largest time indistinguishable under frontier.

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 if one element is less than or equal to the other

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

Returns true if one element is strictly less than the other

impl<__S: Fallible + ?Sized, TOuter, TInner> Serialize<__S> for Product<TOuter, TInner>

where TOuter: Archive + Serialize<__S>, TInner: Archive + Serialize<__S>, <TOuter as Archive>::Archived: Ord, <TInner as Archive>::Archived: Ord,

fn serialize(&self, serializer: &mut __S) -> Result<Self::Resolver, __S::Error>

Writes the dependencies for the object and returns a resolver that can create the archived type.

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

where TOuter: SizeOf, TInner: SizeOf,

fn size_of_children(&self, context: &mut Context)

Gets the size of all “children” owned by this value, not including the size of the value itself.

fn size_of(&self) -> TotalSize

Gets the total size of the current value

fn size_of_with_context(&self, context: &mut Context)

Adds the size of the current value to the given Context, including both the size of the value itself and all of its children

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

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

fn supports_roaring32(&self) -> bool

Returns true if this key type can be represented in a 32-bit roaring bitmap.

fn roaring_u32_offset(&self, _min: &Self) -> Option<u32>

where Self: Sized,

Computes the u32 offset of self relative to min.

fn roaring_u32_offset_dyn(&self, _min: &DynData) -> Option<u32>

Like roaring_u32_offset, but accepts min as a type-erased DynData reference.

fn roaring_u32_offset_dyn_checked(&self, min: &DynData) -> u32

Like roaring_u32_offset_dyn, but panics when the offset cannot be computed.

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

where TOuter: Timestamp, TInner: Timestamp,

const NESTING_DEPTH: usize

Nesting depth of the circuit running this clock.

type Nested = Product<Product<TOuter, TInner>, u32>

type TimedBatch<B: Batch<Time = ()>> = <B as Batch>::Timed<Product<TOuter, TInner>>

A version of a batch type B with Self used as a timestamp.

fn minimum() -> Self

fn clock_start() -> Self

The value of the timestamp when the clock starts ticking.

fn advance(&self, scope: Scope) -> Self

Advance the timestamp by one clock tick.

fn recede(&self, scope: Scope) -> Self

Push the timestamp back by one clock tick.

fn checked_recede(&self, scope: Scope) -> Option<Self>

Like recede, but returns None if the clock at level scope is equal to zero (i.e., we are running the first clock cycle) and hence cannot be decremented.

fn epoch_start(&self, scope: Scope) -> Self

Returns the first time stamp of the current clock epoch in scope.

fn epoch_end(&self, scope: Scope) -> Self

Advance self to the end of the current clock epoch in scope.