def partition_target
import mylsm-lsm-store@0.6.0.1/src/SortedRun.bend as SortedRunimport Base
322# A zero target cannot bound a non-empty partition, so the public partitioning
323# API and its bound predicate consistently interpret it as the smallest safe
324# target: one entry per chunk.
325def partition_target(target: Nat) -> Nat:
326 match target:
327 case 0n:
328 1n
329 case 1n+n:
330 1n+n