HLClock v0.1.2 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

before?(t1, t2)

Determines if the clock’s timestamp “happened before” a different timestamp

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

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

recv(local, remote, physical_time)

Given the current timestamp for this node and a provided remote timestamp, perform the merge of both logical time and logical counters. Returns the new current timestamp for the local node

send(map, pt)

Generate a single HLC Timestamp for sending to other nodes or local causality tracking

Link to this section Functions