Struct PartitionDetector 

pub struct PartitionDetector {
    pub last_seen: HashMap<NodeId, u64>,
    pub timeout_rounds: u64,
    pub current_round: u64,
    pub total_nodes: usize,
}

Partition detector identifies network splits by tracking node reachability.

Maintains a heartbeat map. Nodes that haven’t been heard from within timeout_rounds are considered partitioned. The detector then checks if the remaining reachable nodes form a quorum.

Fields

last_seen: HashMap<NodeId, u64>

timeout_rounds: u64

current_round: u64

total_nodes: usize

Implementations

impl PartitionDetector

pub fn new(total_nodes: usize, timeout_rounds: u64) -> Self

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

pub fn advance_round(&mut self)

pub fn is_alive(&self, node_id: NodeId) -> bool

pub fn alive_nodes(&self) -> Vec<NodeId>

pub fn partitioned_nodes(&self) -> Vec<NodeId>

pub fn has_quorum(&self) -> bool

pub fn is_partitioned(&self) -> bool

Trait Implementations

impl Clone for PartitionDetector

fn clone(&self) -> PartitionDetector

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PartitionDetector

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

Formats the value using the given formatter.