SortedRun.singleton_runs: def of mylsm-lsm-store@0.6.0.1
Import: import mylsm-lsm-store@0.6.0.1/src/SortedRun.bend as SortedRun
Lines 307-314 of mylsm-lsm-store@0.6.0.1/src/SortedRun.bend: https://jend.leeeet.dev/read.txt?path=mylsm-lsm-store@0.6.0.1/src/SortedRun.bend&start_line=307&end_line=314

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

# Canonicalize raw newest-first entries in O(N log N): each entry starts as one
# already-sorted run, and stable EQ selection preserves the earlier/newer entry.
def singleton_runs(entries: List<&2, MemTable.Entry>) -> List<&2, List<&2, MemTable.Entry>>:
  match entries:
    case Nil{}:
      Nil{}
    case Con{entry, rest}:
      Con{Con{entry, Nil{}}, singleton_runs(rest)}

Uses (2):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/MemTable.bend&name=Entry