SortedRun.first_key: def of mylsm-lsm-store@0.6.0.1
Import: import mylsm-lsm-store@0.6.0.1/src/SortedRun.bend as SortedRun
Lines 141-147 of mylsm-lsm-store@0.6.0.1/src/SortedRun.bend: https://jend.leeeet.dev/read.txt?path=mylsm-lsm-store@0.6.0.1/src/SortedRun.bend&start_line=141&end_line=147

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

# L1 helpers operate on entry runs to avoid a SortedRun <-> Sstable cycle.
def first_key(entries: List<&2, MemTable.Entry>) -> Maybe<&2, String>:
  match entries:
    case Nil{}:
      None{}
    case Con{MemTable.Entry{key, val}, t}:
      Some{key}

Uses (4):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=String
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/MemTable.bend&name=Entry