def plan
import mylsm-lsm-store@0.6.0.1/src/BitTree.bend as BitTreeimport Base
45# Handle plan in the packed bit-tree operations.
46def plan(+need: Nat) -> Plan:
47 match need:
48 case 0n:
49 Plan{0n, 0n}
50 case 1n+n:
51 plan_go(need, need, 1n, 0n, Nat.is_le(need, 1n))