Struct BspCoordinator 

pub struct BspCoordinator {
    pub algorithm: String,
    pub iteration: u32,
    pub max_iterations: u32,
    pub tolerance: f64,
    pub shard_ids: Vec<u32>,
    pub acks: HashMap<u32, SuperstepAck>,
    pub completed: bool,
    pub system_as_of: Option<i64>,
}

Fields

algorithm: String

iteration: u32

max_iterations: u32

tolerance: f64

shard_ids: Vec<u32>

acks: HashMap<u32, SuperstepAck>

completed: bool

system_as_of: Option<i64>

Bitemporal system-time ordinal for this run. Stamped onto every SuperstepBarrier so all shards materialize the same historical topology. None means current state.

Implementations

impl BspCoordinator

pub fn new( algorithm: String, max_iterations: u32, tolerance: f64, shard_ids: Vec<u32>, ) -> Self

pub fn new_as_of( algorithm: String, max_iterations: u32, tolerance: f64, shard_ids: Vec<u32>, system_as_of: Option<i64>, ) -> Self

pub fn record_ack(&mut self, ack: SuperstepAck)

pub fn all_acked(&self) -> bool

pub fn global_delta(&self) -> f64

Sum of per-shard convergence deltas. Only meaningful when all_acked().

pub fn total_vertices(&self) -> usize

Total vertex count across all shards. Only meaningful when all_acked().

pub fn advance(&mut self) -> bool

Advance to next superstep. Returns true if should continue.

pub fn barrier_message(&self) -> SuperstepBarrier

pub fn completion_message(&self) -> AlgoComplete

Trait Implementations

impl Debug for BspCoordinator

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

Formats the value using the given formatter.