SortedRun.last_key_go: def of mylsm-lsm-store@0.6.0.1
Import: import mylsm-lsm-store@0.6.0.1/src/SortedRun.bend as SortedRun
Lines 149-155 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=149&end_line=155

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

# Return the last key go in the sorted-run operations.
def last_key_go(entries: List<&2, MemTable.Entry>, last: String) -> Maybe<&2, String>:
  match entries:
    case Nil{}:
      Some{last}
    case Con{MemTable.Entry{key, val}, t}:
      last_key_go(t, 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