SortedRun.partition_finish: def of mylsm-lsm-store@0.6.0.1
Import: import mylsm-lsm-store@0.6.0.1/src/SortedRun.bend as SortedRun
Lines 332-342 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=332&end_line=342

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

# Partition finish for the sorted-run operations.
def partition_finish(
  current_rev: List<&2, MemTable.Entry>,
  chunks_rev: List<&2, List<&2, MemTable.Entry>>
) -> List<&2, List<&2, MemTable.Entry>>:
  match current_rev:
    case Nil{}:
      List.reverse(&2, List<&2, MemTable.Entry>, chunks_rev)
    case Con{entry, rest}:
      chunk = List.reverse(&2, MemTable.Entry, Con{entry, rest})
      List.reverse(&2, List<&2, MemTable.Entry>, Con{chunk, chunks_rev})

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