dottedLattice

kofre.dotted.DotSet$.dottedLattice$

This essentially tracks the currently present dots, and all dots

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Self type

Members list

Concise view

Value members

Concrete methods

override def mergePartial(left: Dotted[DotSet], right: Dotted[DotSet]): DotSet

Attributes

Definition Classes

Inherited methods

def bimap[B](to: Dotted[DotSet] => B, from: B => Dotted[DotSet]): Lattice[B]

Attributes

Inherited from:
Lattice
override def lteq(left: Dotted[DotSet], right: Dotted[DotSet]): Boolean

Lattice order is derived from merge, but should be overridden for efficiency

Lattice order is derived from merge, but should be overridden for efficiency

Attributes

Definition Classes
Inherited from:
DottedLattice
def merge(left: Dotted[DotSet], right: Dotted[DotSet]): Dotted[A]

By assumption: associative, commutative, idempotent.

By assumption: associative, commutative, idempotent.

For use with Delta CRDTs, this function should be optimized for the case that left >> right, i.e., that left is the current state and right the delta

Attributes

Inherited from:
DottedLattice

Extensions

Inherited extensions

extension (left: A)
def <=(right: A): Boolean

Lattice order is derived from merge, but should be overridden for efficiency

Lattice order is derived from merge, but should be overridden for efficiency

Attributes

Inherited from:
Lattice
def merge(right: A): A

Attributes

Inherited from:
Lattice
extension (left: Dotted[A])
def dotmerge(right: Dotted[A]): A

Attributes

Inherited from:
DottedLattice