Struct MostAvailable 

pub struct MostAvailable { /* private fields */ }

Selects the node with the most remaining capacity, with epsilon tie-breaking.

Scoring: each candidate’s score is its remaining_ratio(). When multiple candidates score within epsilon of the best, one is chosen randomly to avoid thundering-herd on the single “most available” node.

Panics

Panics if epsilon is negative or NaN.

Examples

use loadwise::{Strategy, RateMetric, SelectionContext};
use loadwise::strategy::MostAvailable;

struct Key { remaining: f64 }
impl RateMetric for Key {
    fn remaining_ratio(&self) -> f64 { self.remaining }
}

let strategy = MostAvailable::default();
let keys = [Key { remaining: 0.2 }, Key { remaining: 0.8 }, Key { remaining: 0.75 }];
let ctx = SelectionContext::default();

// Picks index 1 or 2 (both within epsilon=0.05 of best 0.8)
let idx = strategy.select(&keys, &ctx).unwrap();
assert!(idx == 1 || idx == 2);

Implementations

impl MostAvailable

pub fn builder() -> MostAvailableBuilder

Create an instance of MostAvailable using the builder syntax

Trait Implementations

impl Debug for MostAvailable

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

Formats the value using the given formatter.

impl Default for MostAvailable

fn default() -> Self

Returns the “default value” for a type.

impl<N: RateMetric> Strategy<N> for MostAvailable

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.