Struct NodeRegistry 

pub struct NodeRegistry { /* private fields */ }

Cluster membership store backed by a consistent hash ring.

Maintains a live map of NodeInfo and mirrors add/remove operations into a ConsistentHashRing so routing decisions stay in sync.

Implementations

impl NodeRegistry

pub fn new() -> Self

Create an empty registry with 150 virtual nodes per real node.

pub fn register(&mut self, info: NodeInfo)

Register a node (or overwrite an existing entry with the same ID).

pub fn deregister(&mut self, node_id: &str)

Remove a node from the registry and the hash ring.

pub fn mark_healthy(&mut self, node_id: &str, healthy: bool)

Update the health status of a node.

If healthy is false the node is kept in the registry but excluded from routing via route_request and healthy_nodes.

pub fn update_load(&mut self, node_id: &str, load: f32)

Update the load factor of a node. Clamped to [0.0, 1.0].

pub fn route_request(&self, request_key: &str) -> Option<&NodeInfo>

Route a request to a healthy node using consistent hashing.

Walks the ring starting at request_key’s hash position and returns the first node that exists in the registry and is healthy. Returns None if there are no healthy nodes.

pub fn healthy_nodes(&self) -> Vec<&NodeInfo>

Returns references to all healthy nodes (arbitrary order).

pub fn all_nodes(&self) -> Vec<&NodeInfo>

Returns references to all registered nodes (arbitrary order).

pub fn ring(&self) -> &ConsistentHashRing

Expose a reference to the underlying ring (read-only).

Trait Implementations

impl Default for NodeRegistry

fn default() -> Self

Returns the “default value” for a type.