Struct PieceQueueEntry 

struct PieceQueueEntry {
    priority: i32,
    order: u64,
    piece_idx: usize,
    depth: i32,
    context_idx: usize,
}

BFS queue entry ordered by descending placement_priority, FIFO within ties.

Fields

priority: i32

order: u64

piece_idx: usize

depth: i32

context_idx: usize

Trait Implementations

impl Eq for PieceQueueEntry

impl Ord for PieceQueueEntry

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

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

Equality operator ==.

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

Inequality operator !=.

impl PartialOrd for PieceQueueEntry

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.

impl StructuralPartialEq for PieceQueueEntry