BlockOrder.advance: 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 37-44 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=37&end_line=44

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

# Validates one entry and retains its key as the next comparison boundary.
def advance(entry: ByteMemTable.Entry, state: State) -> State:
  match entry:
    case ByteMemTable.Entry{key, _}:
      match state:
        case State{valid, previous, count}:
          advance.state(previous, count, valid,
            ByteMemTable.bytes.clone(key))

Uses (4):
  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=bytes.clone
  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.state