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

import Base

# A zero target cannot bound a non-empty partition, so the public partitioning
# API and its bound predicate consistently interpret it as the smallest safe
# target: one entry per chunk.
def partition_target(target: Nat) -> Nat:
  match target:
    case 0n:
      1n
    case 1n+n:
      1n+n

Uses (1):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat