Struct ClockGuard 

pub struct ClockGuard { /* private fields */ }

The latest sample of each peer. A delayed sample looks like a slow peer, so it can pause decisions but never approve a wrong clock: the median needs a majority of the clocks within the tolerance.

Implementations

impl ClockGuard

pub fn new( peers: impl IntoIterator<Item = NodeId>, tolerance_millis: u64, ) -> Self

Compare with peers, allowing tolerance_millis of disagreement.

pub fn observe( &mut self, peer: NodeId, peer_wall_millis: u64, local_wall_millis: u64, now: Duration, )

Keep peer’s sample: its wall time as sent, the local wall time at receipt, and the local monotonic time. Unconfigured peers are ignored.

pub fn forget(&mut self)

Drop every sample. Their offsets were measured against a clock that has since stepped.

pub fn offsets( &self, now: Duration, ) -> impl Iterator<Item = (NodeId, Option<i64>)> + '_

Each peer’s fresh offset in milliseconds, peer minus local.

pub fn verdict(&self, now: Duration) -> ClockVerdict

Take the median of zero (this clock) and the fresh offsets. With two clocks both count, because neither can outvote the other.

Trait Implementations

impl Clone for ClockGuard

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ClockGuard

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

Formats the value using the given formatter.