Module lamport

The Lamport timestamp algorithm is a simple logical clock algorithm used to determine the order of events in a distributed computer system. As different nodes or processes will typically not be perfectly synchronized, this algorithm is used to provide a partial ordering of events with minimal overhead, and conceptually provide a starting point for the more advanced vector clock method. The algorithm is named after its creator, Leslie Lamport.

Source wikipedia.

This is the implementation of this specialized for the use case of git-bug-rs.

Modules

mem

An in-memory implementation of a Clock.

persistent

A persistent Clock implementation.

repository

Lamport Clocks scoped to a git repository.

Structs

Time

The internal representation of a Clock’s time. The only property of this type is that it is always advancing, it is not connected to an actual time stamp.

Traits

Clock

A Lamport clock.