Struct WakeKey 

pub struct WakeKey { /* private fields */ }

Identifies one queued entry, and orders the queue: earliest deadline first, ties broken by submission order. Being a key rather than a field of the entry is what makes an entry addressable — a BinaryHeap can only pop its top, so an entry it holds is reachable by nobody and lives until its deadline no matter who has lost interest.

Trait Implementations

impl Clone for WakeKey

fn clone(&self) -> WakeKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for WakeKey

impl Debug for WakeKey

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

Formats the value using the given formatter.

impl Eq for WakeKey

impl Ord for WakeKey

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

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

Equality operator ==.

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

Inequality operator !=.

impl PartialOrd for WakeKey

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