SortedRun.last_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 157-163 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=157&end_line=163

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

# Return the last key in the sorted-run operations.
def last_key(entries: List<&2, MemTable.Entry>) -> Maybe<&2, String>:
  match entries:
    case Nil{}:
      None{}
    case Con{MemTable.Entry{key, val}, t}:
      last_key_go(t, key)

Uses (5):
  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
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/SortedRun.bend&name=last_key_go