GenericLastWriterWinsLattice

rdts.datatypes.LastWriterWins.GenericLastWriterWinsLattice
class GenericLastWriterWinsLattice[A](conflict: Lattice[A]) extends Lattice[LastWriterWins[A]]

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any

Members list

Value members

Concrete methods

override def merge(left: LastWriterWins[A], right: LastWriterWins[A]): LastWriterWins[A]

By assumption: associative, commutative, idempotent.

By assumption: associative, commutative, idempotent.

Implementation note: If it matters, assume that left is the current state and right is an added delta. All code should assume that left is the larger state (and optimize for this). If left == right, prefer to return left.

Attributes

Definition Classes
override def subsumption(left: LastWriterWins[A], right: LastWriterWins[A]): Boolean

Lattice order is derived from merge. Overriding implementations must make sure that they compute exactly the same results as the equation below.

Lattice order is derived from merge. Overriding implementations must make sure that they compute exactly the same results as the equation below.

Attributes

Definition Classes

Extensions

Inherited extensions

extension (left: LastWriterWins[A])
inline def inflates(right: LastWriterWins[A]): Boolean

Convenience extensions for the above.

Convenience extensions for the above.

Attributes

Inherited from:
Lattice
inline def merge(right: LastWriterWins[A]): LastWriterWins[A]

Convenience extensions for the above.

Convenience extensions for the above.

Attributes

Inherited from:
Lattice
inline def subsumes(right: LastWriterWins[A]): Boolean

Merging right into left has no effect

Merging right into left has no effect

Attributes

Inherited from:
Lattice