Mylsm.sort_newest: def of mylsm-lsm-store@0.3.2.0
Import: import mylsm-lsm-store@0.3.2.0/mylsm.bend as Mylsm
Lines 40-42 of mylsm-lsm-store@0.3.2.0/mylsm.bend: https://jend.leeeet.dev/read.txt?path=mylsm-lsm-store@0.3.2.0/mylsm.bend&start_line=40&end_line=42

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

# Canonicalize newest-first entries into a strict ordered run.
def sort_newest(entries: List<&2, MemTable.Entry>) -> List<&2, MemTable.Entry>:
  SortedRun.sort_newest(entries)

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