Struct WeightedRoundRobin 

pub struct WeightedRoundRobin { /* private fields */ }

Smooth weighted round-robin (Nginx-style).

Each node maintains a running current_weight. On each selection:

1. Add each node’s effective weight to its current weight
2. Select the node with the highest current weight
3. Subtract total weight from the selected node’s current weight

This produces an interleaved sequence that respects relative weights.

State is tracked by a fingerprint of the candidate set (IDs and weights). If the candidate list changes — nodes added/removed/reordered, or a node’s weight changes — the internal state resets and re-converges within a few rounds.

Implementations

impl WeightedRoundRobin

pub fn new() -> Self

Trait Implementations

impl Debug for WeightedRoundRobin

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

Formats the value using the given formatter.

impl Default for WeightedRoundRobin

fn default() -> Self

Returns the “default value” for a type.

impl<N: Weighted + Node> Strategy<N> for WeightedRoundRobin

fn select(&self, candidates: &[N], ctx: &SelectionContext) -> Option<usize>

Pick the next node. Returns None when candidates is empty or all candidates are excluded via SelectionContext::exclude.