Struct st2_logformat::pair::Pair

pub struct Pair<S, T> {
    pub first: S,
    pub second: T,
}

A pair of timestamps, partially ordered by the product order.

Fields

first: S

first part of timestamp

second: T

second part of timestampe

Methods

impl<S, T> Pair<S, T>

pub fn new(first: S, second: T) -> Self

Create a new pair.

Trait Implementations

impl<S: Clone, T: Clone> Clone for Pair<S, T>

fn clone(&self) -> Pair<S, T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<S: Ord, T: Ord> Ord for Pair<S, T>

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

This method returns an Ordering between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

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

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

impl<S: Default, T: Default> Default for Pair<S, T>

fn default() -> Pair<S, T>

Returns the "default value" for a type.

impl<S: PartialOrd, T: PartialOrd> PartialOrd<Pair<S, T>> for Pair<S, T>

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

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

fn lt(&self, other: &Pair<S, T>) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Pair<S, T>) -> bool

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

fn gt(&self, other: &Pair<S, T>) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Pair<S, T>) -> bool

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

impl<S: PartialEq, T: PartialEq> PartialEq<Pair<S, T>> for Pair<S, T>

fn eq(&self, other: &Pair<S, T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Pair<S, T>) -> bool

This method tests for !=.

impl<S: Eq, T: Eq> Eq for Pair<S, T>

impl<TOuter: Debug, TInner: Debug> Debug for Pair<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<S: Hash, T: Hash> Hash for Pair<S, T>

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

Feeds this value into the given [Hasher].

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

Feeds a slice of this type into the given [Hasher].

impl<S, T> Abomonation for Pair<S, T> where
    S: Abomonation,
    T: 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<S: Lattice, T: Lattice> Lattice for Pair<S, T>

Implement differential dataflow's Lattice trait. This extends the PartialOrder implementation with additional structure.

fn minimum() -> Self

The smallest element of the type.

fn join(&self, other: &Self) -> Self

The smallest element greater than or equal to both arguments.

fn meet(&self, other: &Self) -> Self

The largest element less than or equal to both arguments.

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

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

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

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

fn advance_by(&mut self, frontier: &[Self])

Advances self to the largest time indistinguishable under frontier.

impl<S: Timestamp, T: Timestamp> Timestamp for Pair<S, T>

Implement timely dataflow's Timestamp trait.

type Summary = ()

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

impl<S: TotalOrder, T: TotalOrder> TotalOrder for Pair<S, T>

impl<S: PartialOrder, T: PartialOrder> PartialOrder for Pair<S, T>

Implement timely dataflow's PartialOrder trait. Note: This is in fact a total order implementation!

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<S: Timestamp, T: Timestamp> Refines<()> for Pair<S, T>

fn to_inner(_outer: ()) -> Self

Converts the outer timestamp to an inner timestamp.

fn to_outer(self)

Converts the inner timestamp to an outer timestamp.

fn summarize(_summary: Self::Summary)

Summarizes an inner path summary as an outer path summary.

impl<S: Timestamp, T: Timestamp> PathSummary<Pair<S, T>> for ()

Implement timely dataflow's PathSummary trait. This is preparation for the Timestamp implementation below.

fn results_in(&self, timestamp: &Pair<S, T>) -> Option<Pair<S, T>>

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.