ByteMemTable.ordered.merge.counted: def of mylsm-lsm-store@0.6.0.1
Import: import mylsm-lsm-store@0.6.0.1/src/ByteMemTable.bend as ByteMemTable
Lines 644-653 of mylsm-lsm-store@0.6.0.1/src/ByteMemTable.bend: https://jend.leeeet.dev/read.txt?path=mylsm-lsm-store@0.6.0.1/src/ByteMemTable.bend&start_line=644&end_line=653

import Base

def ordered.merge.counted(
  newer: List<&1, Entry> & Nat,
  older: List<&1, Entry> & Nat
) -> List<&1, Entry>:
  match newer:
    case (newer_entries, newer_count):
      match older:
        case (older_entries, older_count):
          fuel = Nat.add(Nat.add(newer_count, older_count), 1n)
          ordered.merge.go(fuel, OrderedMergeState{newer_entries, older_entries, Nil{}})

Uses (8):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.add
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Sigma
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/ByteMemTable.bend&name=Entry
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/ByteMemTable.bend&name=OrderedMergeState
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/ByteMemTable.bend&name=ordered.merge.go