DotStoreLattice

abstract def add(a: Store, d: Dot): Store

abstract def compress(a: Store): Store

abstract def dots(a: Store): Set[Dot]

abstract def empty: Store

abstract def merge(left: Causal[Store], right: Causal[Store]): Causal[Store]

The new element contains all the dots that are either contained in both dotstores or contained in one of the dotstores but not in the causal context (history) of the other one.

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit