Struct RoutingTable 

pub struct RoutingTable { /* private fields */ }

Driver-consumable routing table derived from a topology advertisement plus the current replication term.

Implementations

impl RoutingTable

pub fn from_membership(membership: ClusterMembership, term: u64) -> Self

Build a routing table from a merged membership snapshot and the current replication term. The primary becomes the write endpoint; the advertised replicas become the read pool.

pub fn epoch(&self) -> u64

Epoch of the advertisement this table was built from.

pub fn write_endpoint(&self) -> &WriteEndpoint

The write endpoint — the current primary, keyed by term.

pub fn read_endpoints(&self, bookmark: BookmarkTarget) -> Vec<ReadEndpoint>

The read endpoints with per-node frontier and bookmark eligibility computed against bookmark. Order matches the advertisement.

pub fn route_causal_read( &self, bookmark: BookmarkTarget, opts: &CausalReadOptions, waiter: &mut dyn BookmarkWaiter, ) -> RouteDecision

Resolve a causal read with bounded-wait-then-fallback.

Never errors: a lagging target degrades to a fallback hop (another caught-up replica, else the primary).

Trait Implementations

impl Clone for RoutingTable

fn clone(&self) -> RoutingTable

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RoutingTable

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

Formats the value using the given formatter.

impl PartialEq for RoutingTable

fn eq(&self, other: &RoutingTable) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for RoutingTable

impl StructuralPartialEq for RoutingTable