def resolve_newest_go
mylsm-lsm-store@0.6.0.1 · src/SortedRun.bend:116
import mylsm-lsm-store@0.6.0.1/src/SortedRun.bend as SortedRun
import Base
import mylsm-lsm-store@0.6.0.1/src/MemTable.bend as MemTable
116
117def resolve_newest_go(
118 runs: List<&2, List<&2, MemTable.Entry>>,
119 +key: String,
120 state: Bool & Maybe<&2, Maybe<&2, String>>
121) -> Bool & Maybe<&2, Maybe<&2, String>>:
122 match runs:
123 case Nil{}:
124 state
125 case Con{run, rest}:
126 resolve_newest_go(rest, key, resolve_state(run, key, state))