Struct TabularAlgorithm 

pub struct TabularAlgorithm {
    pub(crate) leap_years: TabularAlgorithmLeapYears,
    pub(crate) epoch: TabularAlgorithmEpoch,
}

Hijri Rules for the Tabular Hijri Algorithm.

See TabularAlgorithmEpoch and TabularAlgorithmLeapYears for customization.

The most common version of these rules uses TabularAlgorithmEpoch::Friday and TabularAlgorithmLeapYears::TypeII.

When constructed with TabularAlgorithmLeapYears::TypeII, and either TabularAlgorithmEpoch::Friday or TabularAlgorithmEpoch::Thursday, this corresponds to the "islamic-civil" and "islamic-tbla" CLDR calendars respectively.

Fields

leap_years: TabularAlgorithmLeapYears

epoch: TabularAlgorithmEpoch

Implementations

impl TabularAlgorithm

pub const fn new( leap_years: TabularAlgorithmLeapYears, epoch: TabularAlgorithmEpoch, ) -> Self

Construct a new TabularAlgorithm with the given leap year rule and epoch.

Trait Implementations

impl Clone for TabularAlgorithm

fn clone(&self) -> TabularAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TabularAlgorithm

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

Formats the value using the given formatter.

impl Hash for TabularAlgorithm

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 TabularAlgorithm

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

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

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

fn calendar_algorithm(&self) -> Option<CalendarAlgorithm>

The BCP-47 CalendarAlgorithm for the Hijri calendar using these rules, if defined.

fn ecma_reference_year( &self, month_code: (u8, bool), day: u8, ) -> Result<i32, EcmaReferenceYearError>

Returns an ECMA reference year that contains the given month-day combination.

fn debug_name(&self) -> &'static str

The debug name for these rules.

fn year_data(&self, extended_year: i32) -> HijriYearData

Returns data about the given year.

impl Copy for TabularAlgorithm

impl Eq for TabularAlgorithm

impl StructuralPartialEq for TabularAlgorithm