Struct PartitionTable 

pub struct PartitionTable { /* private fields */ }

Consistent hashing ring for partition distribution

Implementations

impl PartitionTable

pub fn new() -> Self

Create a new partition table

pub fn add_node(&mut self, node_id: NodeId, virtual_nodes: usize)

Add a node with virtual nodes to the ring

pub fn remove_node(&mut self, node_id: &NodeId)

Remove a node from the ring

pub fn get_nodes_for_key( &self, key: &[u8], replication_factor: usize, ) -> Vec<NodeId>

Get nodes responsible for a key (with replication)

pub fn get_partition(&self, key: &[u8]) -> PartitionId

Get partition for a key

pub fn get_partitions_for_node(&self, node_id: &NodeId) -> Vec<PartitionId>

Get partitions assigned to a node

pub fn rebalance(&mut self)

Rebalance partitions across nodes

pub fn get_distribution_stats(&self) -> PartitionStats

Get distribution statistics