Enum TabularAlgorithmLeapYears 

#[non_exhaustive]
pub enum TabularAlgorithmLeapYears {
    TypeII,
}

The leap year rule for the TabularAlgorithm rules.

This specifies which years of a 30-year cycle have an additional day at the end of the year.

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.

TypeII

Leap years 2, 5, 7, 10, 13, 16, 18, 21, 24, 26, 29

Trait Implementations

impl Clone for TabularAlgorithmLeapYears

fn clone(&self) -> TabularAlgorithmLeapYears

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TabularAlgorithmLeapYears

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

Formats the value using the given formatter.

impl Hash for TabularAlgorithmLeapYears

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

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

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

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

impl Eq for TabularAlgorithmLeapYears

impl StructuralPartialEq for TabularAlgorithmLeapYears