Enum TabularAlgorithmEpoch 

#[non_exhaustive]
pub enum TabularAlgorithmEpoch {
    Thursday,
    Friday,
}

The epoch for the TabularAlgorithm rules.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Thursday

Thusday July 15, 622 AD Julian (0622-07-18 ISO)

Friday

Friday July 16, 622 AD Julian (0622-07-19 ISO)

Trait Implementations

impl Clone for TabularAlgorithmEpoch

fn clone(&self) -> TabularAlgorithmEpoch

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TabularAlgorithmEpoch

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

Formats the value using the given formatter.

impl Hash for TabularAlgorithmEpoch

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

where __H: Hasher,

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 Ord for TabularAlgorithmEpoch

fn cmp(&self, other: &TabularAlgorithmEpoch) -> 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 PartialEq for TabularAlgorithmEpoch

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

fn partial_cmp(&self, other: &TabularAlgorithmEpoch) -> 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 Copy for TabularAlgorithmEpoch

impl Eq for TabularAlgorithmEpoch

impl StructuralPartialEq for TabularAlgorithmEpoch