BitTree.plan: def of mylsm-lsm-store@0.6.0.1
Import: import mylsm-lsm-store@0.6.0.1/src/BitTree.bend as BitTree
Lines 45-51 of mylsm-lsm-store@0.6.0.1/src/BitTree.bend: https://jend.leeeet.dev/read.txt?path=mylsm-lsm-store@0.6.0.1/src/BitTree.bend&start_line=45&end_line=51

import Base

# Handle plan in the packed bit-tree operations.
def plan(+need: Nat) -> Plan:
  match need:
    case 0n:
      Plan{0n, 0n}
    case 1n+n:
      plan_go(need, need, 1n, 0n, Nat.is_le(need, 1n))

Uses (4):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.is_le
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/BitTree.bend&name=Plan
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/BitTree.bend&name=plan_go