def merge_many_newest
import mylsm-lsm-store@0.6.0.1/src/SortedRun.bend as SortedRunimport Base
import mylsm-lsm-store@0.6.0.1/src/MemTable.bend as MemTable
302# Merge many newest for the sorted-run operations.
303def merge_many_newest(+runs: List<&2, List<&2, MemTable.Entry>>) -> List<&2, MemTable.Entry>:
304 fuel = Nat.add(List.length(&2, List<&2, MemTable.Entry>, runs), 1n)
305 merge_many_go(fuel, rank_runs(runs, 0n))