kuilt-crdt/us.tractat.kuilt.crdt/DotMap

DotMap

@Serializable

class DotMap<K, S : DotStore<S>>(val entries: Map<K, S> = emptyMap()) : DotStore<DotMap<K, S>>

A DotStore mapping keys K to nested DotStores S. The causal join is applied per key, recursively, using the surrounding contexts; a key whose nested store becomes bottom (empty) is dropped. Causal<DotMap<E, DotSet>> is an OR-Set; a richer nested store gives an OR-Map.

Constructors

DotMap

constructor(entries: Map<K, S> = emptyMap())

Properties

dots

open override val dots: Set<Dot>

Every dot currently live in this store.

empty

open override val empty: DotMap<K, S>

The empty (bottom) store of this shape — no dots.

entries

val entries: Map<K, S>

isBottom

open val isBottom: Boolean

True when the store holds no dots.

Functions

equals

open operator override fun equals(other: Any?): Boolean

hashCode

open override fun hashCode(): Int

join

open override fun join(other: DotMap<K, S>, context: DotContext, otherContext: DotContext): DotMap<K, S>

The causal join with other. A dot is kept when it is live in both stores, or live in one and not yet witnessed by the other side's context; it is dropped only when one side still has it while the other has it in otherContext but not in its store — the signature of a deliberate remove. context is this store's surrounding causal history; otherContext is the other's.

toString

open override fun toString(): String