Crdt.KCounter.merge: def of bend-kit-crdt@0.2.0.0
Import: import bend-kit-crdt@0.2.0.0/crdt.bend as Crdt
Lines 255-257 of bend-kit-crdt@0.2.0.0/crdt.bend: https://jend.leeeet.dev/read.txt?path=bend-kit-crdt@0.2.0.0/crdt.bend&start_line=255&end_line=257

import Base

# The union of two ID-sorted states, with the maximum count where IDs are equal.
def KCounter.merge(~K: Data, ~cmp: K -> K -> Cmp, +a: KCounter<K>, +b: KCounter<K>) -> KCounter<K>:
  KCounter.merge.go(~K, ~cmp, a, b, KCounter.heads(~K, ~cmp, a, b))

Uses (4):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Cmp
  https://jend.leeeet.dev/definition.txt?path=bend-kit-crdt@0.2.0.0/crdt.bend&name=KCounter
  https://jend.leeeet.dev/definition.txt?path=bend-kit-crdt@0.2.0.0/crdt.bend&name=KCounter.heads
  https://jend.leeeet.dev/definition.txt?path=bend-kit-crdt@0.2.0.0/crdt.bend&name=KCounter.merge.go