SortedRun.resolve_newest_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 116-126 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=116&end_line=126

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

# Resolve newest go for the sorted-run operations.
def resolve_newest_go(
  runs: List<&2, List<&2, MemTable.Entry>>,
  +key: String,
  state: Bool & Maybe<&2, Maybe<&2, String>>
) -> Bool & Maybe<&2, Maybe<&2, String>>:
  match runs:
    case Nil{}:
      state
    case Con{run, rest}:
      resolve_newest_go(rest, key, resolve_state(run, key, state))

Uses (7):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  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=Pair
  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=resolve_state