pub struct Product<TOuter, TInner> {
pub outer: TOuter,
pub inner: TInner,
}
Expand description
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§
Trait Implementations§
source§impl<TOuter, TInner> Abomonation for Product<TOuter, TInner>where
TOuter: Abomonation,
TInner: Abomonation,
impl<TOuter, TInner> Abomonation for Product<TOuter, TInner>where
TOuter: Abomonation,
TInner: Abomonation,
source§impl<T1: Columnation, T2: Columnation> Columnation for Product<T1, T2>
impl<T1: Columnation, T2: Columnation> Columnation for Product<T1, T2>
§type InnerRegion = ProductRegion<<T1 as Columnation>::InnerRegion, <T2 as Columnation>::InnerRegion>
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.source§impl<'de, TOuter, TInner> Deserialize<'de> for Product<TOuter, TInner>where
TOuter: Deserialize<'de>,
TInner: Deserialize<'de>,
impl<'de, TOuter, TInner> Deserialize<'de> for Product<TOuter, TInner>where
TOuter: Deserialize<'de>,
TInner: 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<TOuter: Ord, TInner: Ord> Ord for Product<TOuter, TInner>
impl<TOuter: Ord, TInner: Ord> Ord for Product<TOuter, TInner>
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<TOuter: PartialEq, TInner: PartialEq> PartialEq for Product<TOuter, TInner>
impl<TOuter: PartialEq, TInner: PartialEq> PartialEq for Product<TOuter, TInner>
source§impl<TOuter: PartialOrd, TInner: PartialOrd> PartialOrd for Product<TOuter, TInner>
impl<TOuter: PartialOrd, TInner: PartialOrd> PartialOrd for Product<TOuter, TInner>
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 moresource§impl<TOuter: PartialOrder, TInner: PartialOrder> PartialOrder for Product<TOuter, TInner>
impl<TOuter: PartialOrder, TInner: PartialOrder> PartialOrder for Product<TOuter, TInner>
source§impl<TOuter: Timestamp, TInner: Timestamp> PathSummary<Product<TOuter, TInner>> for Product<TOuter::Summary, TInner::Summary>
impl<TOuter: Timestamp, TInner: Timestamp> PathSummary<Product<TOuter, TInner>> for Product<TOuter::Summary, TInner::Summary>
source§impl<TOuter: Timestamp, TInner: Timestamp> Refines<TOuter> for Product<TOuter, TInner>
impl<TOuter: Timestamp, TInner: Timestamp> Refines<TOuter> for Product<TOuter, TInner>
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,
Auto Trait Implementations§
impl<TOuter, TInner> Freeze for Product<TOuter, TInner>
impl<TOuter, TInner> RefUnwindSafe for Product<TOuter, TInner>where
TOuter: RefUnwindSafe,
TInner: RefUnwindSafe,
impl<TOuter, TInner> Send for Product<TOuter, TInner>
impl<TOuter, TInner> Sync for Product<TOuter, TInner>
impl<TOuter, TInner> Unpin for Product<TOuter, TInner>
impl<TOuter, TInner> UnwindSafe for Product<TOuter, TInner>where
TOuter: UnwindSafe,
TInner: 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.
source§impl<T> CopyOnto<MirrorRegion<T>> for Twhere
T: Index,
impl<T> CopyOnto<MirrorRegion<T>> for Twhere
T: Index,
source§fn copy_onto(self, _target: &mut MirrorRegion<T>) -> T
fn copy_onto(self, _target: &mut MirrorRegion<T>) -> T
Copy self into the target container, returning an index that allows to
look up the corresponding read item.
source§impl<T> ProgressEventTimestamp for T
impl<T> ProgressEventTimestamp for T
source§impl<T> ReserveItems<MirrorRegion<T>> for Twhere
T: Index,
impl<T> ReserveItems<MirrorRegion<T>> for Twhere
T: Index,
source§fn reserve_items<I>(_target: &mut MirrorRegion<T>, _items: I)
fn reserve_items<I>(_target: &mut MirrorRegion<T>, _items: I)
Ensure that the region can absorb
items
without reallocation.