LastWriterWinsResolver
Defined in: src/persistence/replicated/ConflictResolver.ts:56
Last-writer-wins on (timestamp, replicaId). Higher timestamp
wins; on ties the higher (lexicographic) replicaId wins so every
replica converges deterministically.
Caveat: relies on wall-clock timestamps being roughly comparable
across replicas. Same trade-off as LWWRegister.
Type Parameters
Section titled “Type Parameters”E
Implements
Section titled “Implements”Constructors
Section titled “Constructors”Constructor
Section titled “Constructor”new LastWriterWinsResolver<
E>():LastWriterWinsResolver<E>
Returns
Section titled “Returns”LastWriterWinsResolver<E>
Methods
Section titled “Methods”resolve()
Section titled “resolve()”resolve(
a,b):E
Defined in: src/persistence/replicated/ConflictResolver.ts:57
Pick a single event from a concurrent pair. Implementations
MUST be commutative — resolve(a, b) must equal resolve(b, a).
Return one of the inputs, or a synthesised merge of both —
either is fine as long as the result is deterministic across
replicas.
Parameters
Section titled “Parameters”Returns
Section titled “Returns”E