BlockOrder.go: def of mylsm-lsm-store@0.6.0.1
Import: import mylsm-lsm-store@0.6.0.1/src/scan/BlockOrder.bend as BlockOrder
Lines 46-51 of mylsm-lsm-store@0.6.0.1/src/scan/BlockOrder.bend: https://jend.leeeet.dev/read.txt?path=mylsm-lsm-store@0.6.0.1/src/scan/BlockOrder.bend&start_line=46&end_line=51

import Base
import mylsm-lsm-store@0.6.0.1/src/ByteMemTable.bend as ByteMemTable

# Checks every ordered entry in a block and carries the final key forward.
def go(entries: List<&1, ByteMemTable.Entry>, state: State) -> State:
  match entries:
    case Nil{}: state
    case Con{entry, tail}:
      go(tail, advance(entry, state))

Uses (4):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  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/scan/BlockOrder.bend&name=State
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/scan/BlockOrder.bend&name=advance