def first_key
import mylsm-lsm-store@0.6.0.1/src/SortedRun.bend as SortedRunimport Base
import mylsm-lsm-store@0.6.0.1/src/MemTable.bend as MemTable
141# L1 helpers operate on entry runs to avoid a SortedRun <-> Sstable cycle.
142def first_key(entries: List<&2, MemTable.Entry>) -> Maybe<&2, String>:
143 match entries:
144 case Nil{}:
145 None{}
146 case Con{MemTable.Entry{key, val}, t}:
147 Some{key}