Implements a 'Last Writer Wins Register' CRDT, also called a 'LWW-Register'. It is described in the paper A comprehensive study of Convergent and Commutative Replicated Data Types. Merge takes the register with highest timestamp. Note that this relies on synchronized clocks. LWWRegisterT should only be used when the choice of value is not important for concurrent updates occurring within the clock skew. Merge takes the register updated by the node with lowest address (UniqueAddress is ordered) if the timestamps are exactly the same. Instead of using timestamps based on `DateTime.UtcNow` time it is possible to use a timestamp value based on something else, for example an increasing version number from a database record that is used for optimistic concurrency control. For first-write-wins semantics you can use the ReverseClock instead of the [[LWWRegister#defaultClock]] This class is immutable, i.e. "modifying" methods return a new instance.

[SerializableAttribute]
public class LWWRegister<T> : IReplicatedData<LWWRegister<T>>, 
	IReplicatedData, IReplicatedDataSerialization, IEquatable<LWWRegister<T>>

[<SerializableAttribute>]
type LWWRegister<'T> =  
    class
        interface IReplicatedData<LWWRegister<'T>>
        interface IReplicatedData
        interface IReplicatedDataSerialization
        interface IEquatable<LWWRegister<'T>>
    end