bend-kit-crdt

Search uses release 0.2.0.0 · 56 definitions

Releases (3)

0.2.0.0 indexed
0.1.1.0 unindexed
0.1.0.0 unindexed

Definitions (56)

crdt.bend

def GCounter.newThe counter with no increments.
def GCounter.getThe count of replica i.
def GCounter.mergeComponent-wise maximum.
def GCounter.merge_allThe merge of every state in the list.
def GCounter.padZeros for replicas 0 to i - 1, then 1 for replica i.
def GCounter.cons
def GCounter.inc.atok is false when n wrapped to 0.
def GCounter.incAdds 1 to the count of replica i.
def GCounter.add
def GCounter.value.go
def GCounter.valueThe sum of all counts.
def GCounter.leTrue when a is at most b in every entry.
def GCounter.valid.go
def GCounter.validA valid state has no trailing 0, so each count vector has one form.
def GCounter.size
def GCounter.to_cbor.items
def GCounter.to_cborA CBOR array of unsigned integers: the count of replica i is item i.
def GCounter.from_cbor.word
def GCounter.from_cbor.item
def GCounter.from_cbor.items
def GCounter.from_cbor.gate
def GCounter.from_cbor.check
def GCounter.from_cborA valid state with at most cap replicas, or None.
def GCounter.encodeAlways Some: every item is an unsigned integer.
def GCounter.decode.go
def GCounter.decodeCBOR bytes to a valid state with at most cap replicas, or None.
type KCounterA G-Counter keyed by replica IDs.
def KCounter.newThe counter with no increments.
def KCounter.headcmp(x, first ID of b), or EQ when b is empty.
def KCounter.headsThe comparison of the first IDs of a and b, or EQ when either is empty.
def KCounter.hit
def KCounter.getThe count of replica k: the largest count under an ID that cmp makes equal to k.
def KCounter.merge.goq is KCounter.heads(a, b).
def KCounter.mergeThe union of two ID-sorted states, with the maximum count where IDs are equal.
def KCounter.merge_allThe merge of every state in the list.
def KCounter.cons
def KCounter.inc.atok is false when n wrapped to 0.
def KCounter.inc.goq is KCounter.head(k, s).
def KCounter.incAdds 1 to the count of replica k.
def KCounter.value.go
def KCounter.valueThe sum of all counts.
def KCounter.leTrue when each count in a is at most the count of its ID in b.
def KCounter.aboveTrue when s is empty or its first ID is above lo.
def KCounter.validA valid state has strictly ascending IDs and no 0 count, so each counter has one form.
def KCounter.size
def KCounter.to_cbor.items
def KCounter.to_cborA CBOR map from each encoded ID to its count, in ID order.
def KCounter.from_cbor.word
def KCounter.from_cbor.count
def KCounter.from_cbor.items
def KCounter.from_cbor.gate
def KCounter.from_cbor.check
def KCounter.from_cborA valid state with at most cap replicas, or None.
def KCounter.encodeNone only when enc gives a value with no CBOR form.
def KCounter.decode.go
def KCounter.decodeCBOR bytes to a valid state with at most cap replicas, or None.