def ordered.merge.counted
mylsm-lsm-store@0.6.0.1 · src/ByteMemTable.bend:644
import mylsm-lsm-store@0.6.0.1/src/ByteMemTable.bend as ByteMemTable
import Base
644def ordered.merge.counted(
645 newer: List<&1, Entry> & Nat,
646 older: List<&1, Entry> & Nat
647) -> List<&1, Entry>:
648 match newer:
649 case (newer_entries, newer_count):
650 match older:
651 case (older_entries, older_count):
652 fuel = Nat.add(Nat.add(newer_count, older_count), 1n)
653 ordered.merge.go(fuel, OrderedMergeState{newer_entries, older_entries, Nil{}})