def entry_transition

mylsm-lsm-store@0.3.2.0 · src/SstFileV2.bend:323

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

323def entry_transition(+entry: MemTable.Entry, remaining: Nat, previous: Maybe<&2, String>, entries: List<&2, MemTable.Entry>, level: Nat, declared: Nat, body_rev: String, consumed: Nat) -> Decoder:
324  match entry:
325    case MemTable.Entry{+key, +val}:
326      match previous:
327        case None{}:
328          ordered_entry(MemTable.Entry{key, val}, remaining, entries, level, declared, body_rev, consumed)
329        case Some{+old}:
330          order_decision(Keys.cmp(old, key), MemTable.Entry{key, val}, remaining, entries, level, declared, body_rev, consumed)