Struct RendezvousHash 

pub struct RendezvousHash<K> { /* private fields */ }

Highest-random-weight selection over explicit stable member tokens.

The deterministic score mixes the route-key hash with each eligible member token and selects the greatest score, breaking ties by membership order. Evidence and identity laws are the same as ConsistentHash. This is a reviewed local algorithm so external crates cannot silently own Bombay’s membership or hash policy. Router owns recipient identity and order; this policy retains only the corresponding versioned token evidence.

Implementations

impl<K> RendezvousHash<K>

pub const fn new(hash_key: fn(&K) -> u64) -> Self

Construct a highest-random-weight policy.

Trait Implementations

impl<K> Clone for RendezvousHash<K>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Route, K> RoutingStrategy<Route> for RendezvousHash<K>

where Route: DeliveryRoute + Clone + PartialEq, <Route::Protocol as Protocol>::Msg: RouteKey<K>,

type Observation = MemberTokenObservation<Route>

Closed observation type accepted by this policy.

type Error = MemberEvidenceError

Concrete observation rejection reason.

fn select( &mut self, members: &[Route], message: &<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.