def resolve_newest_go

mylsm-lsm-store@0.3.2.0 · src/SortedRun.bend:95

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

95def 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>>:
96  match runs:
97    case Nil{}:
98      state
99    case Con{run, rest}:
100      resolve_newest_go(rest, key, resolve_state(run, key, state))