ByteMemTable.ordered.merge.go: def of mylsm-lsm-store@0.6.0.1
Import: import mylsm-lsm-store@0.6.0.1/src/ByteMemTable.bend as ByteMemTable
Lines 630-642 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=630&end_line=642

import Base

def ordered.merge.go(fuel: Nat, state: OrderedMergeState) -> List<&1, Entry>:
  match fuel:
    case 0n: ordered.merge.finish(state)
    case 1n+rest:
      match state:
        case OrderedMergeState{newer, older, reversed}:
          match newer older:
            case Nil{} _: List.reverse.go(&1, Entry, reversed, older)
            case _ Nil{}: List.reverse.go(&1, Entry, reversed, newer)
            case Con{newer_head, newer_tail} Con{older_head, older_tail}:
              ordered.merge.go(rest, ordered.merge.compare(
                OrderedMergeState{newer_tail, older_tail, reversed},
                newer_head, older_head))

Uses (7):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.reverse.go
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  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.compare
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/ByteMemTable.bend&name=ordered.merge.finish