Struct HeapEntry 

pub struct HeapEntry<K: Ord, R> {
    pub key: K,
    pub index: usize,
    pub record: R,
}

One candidate in a bounded top-K stream. key carries every tie-break the equivalent full-materialize-then-sort_by code would apply; index is always the final tiebreak layer, reproducing sort_by’s stability – which a heap has no notion of on its own, since two records can otherwise agree on every field key compares. record is left generic (R) rather than fixed to any one domain’s row type, so this heap is reusable outside shogiesa.

Fields

key: K

index: usize

record: R

Trait Implementations

impl<K: Ord, R> Eq for HeapEntry<K, R>

impl<K: Ord, R> Ord for HeapEntry<K, R>

fn cmp(&self, other: &Self) -> 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<K: Ord, R> PartialEq for HeapEntry<K, R>

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

Equality operator ==.

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

Inequality operator !=.

impl<K: Ord, R> PartialOrd for HeapEntry<K, R>

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