Struct LeapEntry 

pub struct LeapEntry {
    pub tai_nanos: u64,
    pub tai_minus_utc: i32,
}

One leap-second table entry.

Starting from tai_minus_utc (internal TAI nanoseconds), TAI - UTC = tai_minus_utc seconds.

Strict contract: the table must be sorted by tai_nanos in ascending order.

Fields

tai_nanos: u64

Internal TAI nanoseconds (inclusive lower bound).

tai_minus_utc: i32

TAI - UTC in whole seconds, valid from this moment onward.

Implementations

impl LeapEntry

pub const fn new(tai_nanos: u64, tai_minus_utc: i32) -> Self

Creates a new leap-second entry.

Parameters

• tai_nanos: threshold value in TAI nanoseconds (inclusive lower bound) from which this offset applies.
• tai_minus_utc: TAI - UTC in seconds that applies from this threshold.

Trait Implementations

impl Clone for LeapEntry

fn clone(&self) -> LeapEntry

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LeapEntry

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

Formats the value using the given formatter.

impl Hash for LeapEntry

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 PartialEq for LeapEntry

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

impl Eq for LeapEntry

impl StructuralPartialEq for LeapEntry