def merge_newer
import mylsm-lsm-store@0.3.2.0/src/SortedRun.bend as SortedRunimport Base
import mylsm-lsm-store@0.3.2.0/src/MemTable.bend as MemTable
229def merge_newer(+newer: List<&2, MemTable.Entry>, +older: List<&2, MemTable.Entry>) -> List<&2, MemTable.Entry>:
230 fuel = Nat.add(Nat.add(List.length(&2, MemTable.Entry, newer), List.length(&2, MemTable.Entry, older)), 1n)
231 merge_go(fuel, (Nil{}, newer, older))