Struct Candidate 

struct Candidate {
    cost: f64,
    a: u32,
    b: u32,
}

One entry in the merge queue: an interface, with the ΔC it had when queued.

The cost is carried along so a stale entry can be recognised on the way out and requeued at its true value, rather than the queue having to be rebuilt on each merge.

Fields

cost: f64

a: u32

b: u32

Trait Implementations

impl Clone for Candidate

fn clone(&self) -> Candidate

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Candidate

impl Eq for Candidate

impl Ord for Candidate

fn cmp(&self, other: &Self) -> Ordering

Orders by cost, then by region id so ties break the same way on every run.

BinaryHeap is a max-heap, so the id comparisons are reversed: of two interfaces with equal ΔC, the one with the lower ids is merged first.

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 Candidate

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

Equality operator ==.

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

Inequality operator !=.

impl PartialOrd for Candidate

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 Candidate