Lattice

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

Decompose a state into potentially smaller parts. The only requirement is that merging the decomposed results produces the original state. Requires a bottom to enable automatic decomposition of Product types Note that the goal here is small individual storage size at reasonable computational cost. Minimalism of returned results is not guaranteed. It is also not guaranteed that the result does not overlap.

computes delta without state

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