HLClock

v0.1.1

HLClock v0.1.1 HLClock.Timestamp View Source

HLC Timestamp

Implements the necessary components of the HLC tuple (i.e. logical time and logical counter) with extension to support node ids to provide unique timestamps even in cases where time and counter are the same

Binary representations assume big endianness for interop simplicity with other languages/representations.

Link to this section Summary

Functions

compare(_, _)

Exhaustive comparison of two timestamps: precedence is in order of time component, logical counter, and finally node identifier

decode(arg)

Construct a Timestamp from the binary representation

encode(map)

Pack the rich Timestamp struct as a 128 bit byte array

less?(t1, t2)
new(time, counter, node_id \\ 0)

Construct a timestamp from its principal components: logical time (initially node’s physical time), logical counter (initally zero), and the node id

Link to this section Functions

Link to this function compare(_, _) View Source

Exhaustive comparison of two timestamps: precedence is in order of time component, logical counter, and finally node identifier

Link to this function decode(arg) View Source

Construct a Timestamp from the binary representation

Link to this function encode(map) View Source

Pack the rich Timestamp struct as a 128 bit byte array

48 bits - Physical time 16 bits - Logical time 64 bits - Node ID

Link to this function new(time, counter, node_id \\ 0) View Source

Construct a timestamp from its principal components: logical time (initially node’s physical time), logical counter (initally zero), and the node id