Struct LeastLoaded 

pub struct LeastLoaded {
    pub metric: LoadMetric,
}

The least loaded candidate, load measured per unit of weight.

A candidate’s load (address_count under a count metric, the representative’s peak-EWMA connection time under LoadMetric::ConnectionTime) is divided by its backend_weight: a backend of weight 200 carrying 10 connections is as loaded as one of weight 100 carrying 5. The weight is clamped to at least 1, as for every weighted policy but Random, so a 0 or negative weight counts as 1, the smallest share, and never excludes a backend.

The first minimum in view order wins a tie. With equal weights (the default: an unset weight reads as DEFAULT_WEIGHT) the comparison is the one on raw loads, so the selection is the one made before the weight was read.

Fields

metric: LoadMetric

Trait Implementations

impl Debug for LeastLoaded

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

Formats the value using the given formatter.

impl LoadBalancingAlgorithm for LeastLoaded

fn next_available_backend( &mut self, _key: Option<u64>, backends: Candidates<'_>, ) -> Option<Rc<RefCell<Backend>>>

Select the next backend among candidates.

fn rebuild(&mut self, _backends: &[Rc<RefCell<Backend>>])

Called by the control plane when the live backend set for a cluster changes, so table-based policies (Maglev) can recompute their lookup table off the datapath. The default is a no-op; Maglev rebuilds its table, and RoundRobin (with the round-robin fallback of Rendezvous and Maglev) resets its running weights.