Struct LeastLoaded 

pub struct LeastLoaded { /* private fields */ }

Deterministic selection of the lowest observed load.

Membership begins Unknown and is ineligible until typed versioned evidence arrives. Ties use membership order. Unknown, stale, and same-version conflicting evidence is rejected without mutation; identical evidence is idempotent. Membership removal discards its evidence. These evidence and tie rules are Bombay policy; gathering load remains an Environment concern. Evidence follows the Router’s member order; only Router owns recipient identity and exposes recipient-based lookup through Router::load_evidence.

Implementations

impl LeastLoaded

pub const fn new() -> Self

Construct a policy whose membership state is populated by Router.

Trait Implementations

impl Clone for LeastLoaded

fn clone(&self) -> LeastLoaded

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Default for LeastLoaded

fn default() -> Self

Returns the “default value” for a type.

impl<Route: DeliveryRoute + Clone + PartialEq> RoutingStrategy<Route> for LeastLoaded

type Observation = LoadObservation<Route>

Closed observation type accepted by this policy.

type Error = MemberEvidenceError

Concrete observation rejection reason.

fn select( &mut self, members: &[Route], _: &<Route::Protocol as Protocol>::Msg, ) -> Option<usize>

Select at most one index from this exact typed membership snapshot.

fn observe( &mut self, members: &[Route], observation: Self::Observation, ) -> Result<(), RoutingObservationRejection<Self::Observation, Self::Error>>

Fold one typed observation against the same membership snapshot.

fn added(&mut self, _: Route)

Update policy-local state after one new membership is committed.

fn removed(&mut self, index: usize, _: Route, _: usize)

Repair policy-local position after a membership removal.