Struct Tier 

pub struct Tier(/* private fields */);

A tier index, relative to the beat.

Implementations

impl Tier

pub const BEAT: Tier

The base tier, 5^60, ~46.762 ms.

pub const TICK: Tier

One tick, 5^0. The finest addressable interval (G2).

pub const DEEP: Tier

5^85, ~441.607 Myr.

pub const DRIFT: Tier

5^80, ~141.314 kyr.

pub const SPAN: Tier

5^75, ~45.221 yr.

pub const SWEEP: Tier

5^70, ~5.285 d.

pub const ARC: Tier

5^65, ~146.130 s.

pub const FLICKER: Tier

5^55, ~14.964 us.

pub const GLINT: Tier

5^50, ~4.788 ns.

pub const SPARK: Tier

5^45, ~1.532 ps.

pub const fn new(k: i8) -> Result<Tier>

Construct from a tier index, rejecting indices outside the grid.

pub const fn from_exponent(exponent: u32) -> Result<Tier>

Construct from a power-of-five exponent, which must lie on the grid.

pub const fn index(self) -> i8

The tier index.

pub const fn exponent(self) -> u32

The power-of-five exponent. This is the tier’s canonical identity (Rule N).

pub const fn is_tick(self) -> bool

Whether this is the tick tier, where truncation is the identity.

pub const fn coarser(self) -> Option<Tier>

The next coarser tier, or None at the top of the grid.

pub const fn finer(self) -> Option<Tier>

The next finer tier, or None at the tick.

pub fn ticks(self) -> Ticks

The tier’s magnitude in ticks: 5^(60 + 5k).

pub fn all_descending() -> impl Iterator<Item = Tier>

Every tier, coarsest first.

pub fn all_ascending() -> impl Iterator<Item = Tier>

Every tier, finest first.

Trait Implementations

impl Clone for Tier

fn clone(&self) -> Tier

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Tier

impl Debug for Tier

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

Formats the value using the given formatter.

impl Display for Tier

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

Renders as T<k>, the notation Rule N requires implementations to accept wherever a name is accepted.

impl Eq for Tier

impl Hash for Tier

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 Tier

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

fn eq(&self, other: &Tier) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl PartialOrd for Tier

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